CCS3101-CS1E

It selects the smallest element from the remaining elements, exchanges this element in the correct position.

• Merge Sort

• Selection Sort

• Insertion Sort

• Bubble Sort

Exchanging an element at a time with the partially sorted array.

• Insertion Sort

• Radix Sort

• Heap Sort

• Bubble Sort

This sorting algorithm uses a pivot element from the array.

• Shell Sort

• Heap Sort

• Bubble Sort

• Quick Sort

It first sorts the elementsm which are far apart from each other and reduces the interval between the elements to be sorted.

• Heap Sort

• Shell Sort

• Radix Sort

• Merge Sort

Linear search algorithm follows a sequential search in the elements of a list _______

Matched items in the simple search tree will be retrieved through indices, while unmatched items will be __________

It consists of the left and right subtrees.________

The right subtree has keys ______ than the root.

Linear Order selection algorithm follows a _____ search technique.

Differentiate Linear Order Selection algorithm from the rank selection algorithm