Skip to content
Pooja Bhatia Classes Hari Nagar
  • We teach following classes
    • Class 12
    • Class 11
    • Class 10
    • Class 9
  • Sumita Arora IP/CS Solutions
  • Jobs/Internship
Pooja Bhatia Classes Hari Nagar

Class 11 CS Chapter 14 Back Exercise Part A Solutions Sumita Arora New Syllabus

/ Listing11CSSA, Uncategorized / By Neha
2. What is the basic principle of sorting in bubble sort ?
...
click here for answer
3. Why do number-of-comparisons reduce in every successive iteration in bubble sort ?
...
click here for answer
4. On which basis can you determine if an algorithm is efficient or not ?
...
click here for answer
5. What is the basic principle of sorting in insertion sort ?
...
click here for answer
6. Number of operations wise, compare bubble sort and insertion sort techniques.
...
click here for answer
7. Why is insertion sort considered a better algorithm than bubble sort ?
...
click here for answer
8. In which situations, insertion sort also becomes inefficient ?
...
click here for answer
9. What is the main difference between Bubble sort and Insertion sort techniques ?
...
click here for answer
10. When and why would you choose insertion sort over bubble sort?
...
click here for answer
1. What is sorting ? Name some sorting techniques.
...
click here for answer
Post navigation
← Previous Post
Next Post →
  • We teach following classes
    • Class 12
    • Class 11
    • Class 10
    • Class 9
  • Sumita Arora IP/CS Solutions
  • Jobs/Internship
  • We teach following classes
  • Sumita Arora IP/CS Solutions
  • Jobs/Internship

Copyright © 2025 Pooja Bhatia Classes Hari Nagar | Powered by Pooja Bhatia Classes Hari Nagar.