Understanding Sorting || Type A || Sumita Arora || Class 11 || Computer science || Information practices || Solution

Understanding Sorting || Type A || Sumita Arora || Class 11 || Computer science || Information practices || Solution

 

 

Q1. What is sorting? Name some sorting techniques.



Q2. What is the basic principle of sorting in bubble sort?



Q3. Why do number-of-comparisons reduce in every successive iteration in bubble sort?



Q4. On which basis can you determine if an algorithm is efficient or not?



Q5. What is the basic principle of sorting in insertion sort ?



Q6. Number of operations wise, compare bubble sort and insertion sort techniques



Q7. Why is insertion sort considered a better algorithm than bubble sort?



Q8. In which situations, insertion sort also becomes inefficient?



Q9. What is the main difference between Bubble sort and Insertion sort techniques ?




Q10. When and why would you choose insertion sort over bubble sort?