b. place data[index] in correct position among data[0] . . data[pass]
2. End
Explanation
The algorithm for insertion sort requires a for loop and while loop.
The outer for loop must iterate once for each element in the data set (of size n) while the inner while loop executes swapping according to the elements which are placed in correct position in sorted portion
In Each pass , the next largest element of the data is moved to its proper place. Therefore, to get all n elements in their correct places, the outer loop must be executed n-1 times.
The inner loop is executed on each iteration of the outer loop.
Bubble sort is a sorting algorithm that works by repeatedly stepping through lists that need to be sorted, comparing each pair of adjacent items and swapping them ...Read more »
A simple sorting technique that scans the sorted list, starting at the beginning, for the correct insertion point for each of the items from the unsorted list… Read more »
It starts by comparing the entire list for the lowest item and moves it to the #1 position. It then compares the rest of the list for the next-lowest item....Read more »
A sorting technique that sequences a list by continuously dividing the list into two parts and moving the lower items to one side and the higher items to the other. … Read more »
The efficeieny of the quicksort depends on the pivot element. However the pivot element can also be choosen at random order or from the last element of the array