Fill In the Blanks For Understanding Sorting Class 11 CS

Fill In the Blanks For Understanding Sorting Class 11 Computer Science (CS)

1. ____ refers to the arrangement of elements in a specific order.

2. The algorithm that sorts elements by comparing two adjacent elements and swapping them to be in the right order is called _____ sort.

3. The Bubble sort algorithm will take maximum _____ passes to sort an array of p elements.

4. The algorithm that picks one element at a time from unsorted segment and places it to its correct position as the sort order in sorted segment is called _____ sort.

5. The insertion sort algorithm will take maximum _____ passes to sort an array of n elements.

Answer :-

1. sorting
2. Bubble
3, p - 1
4. Insertion
5. n - 1