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 »
Algorithm-selection sort
Algorithm SelectionSort(data[],n)
For pass = n-1 down to 1
a.Select largest among data[0] .. data[pass]
b.Interchange largest and data[pass]
End
Explanation
- Selection sort selects the largest(or smallest)element from the list to be sorted and place it in its correct position.
- If the largest element is taken, then it is placed in its last position.
- As in the previous types of sorts ,we find that one element moves to the correct position in evey pass.
- With every pass the sorted portion of the list grows by 1 and the unsorted portion shrinks by 1.
- We need to repeat the process n times.
Sorting by MS.K.Abirami
-
BUBBLE SORT
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 »
-
INSERTION SORT
SELECTION SORT
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 »
QUICK SORT
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 »
BUBBLE SORT
The number of comparison between elements and the number of exchange between elements determine the efficiency of Bubble Sort algorithm.Read more »
Insertion SORT
Insertion sort is also a time taking technique as its complexity is O(n2)Read more »
selection SORT
The number of comparison between elements and the number of exchange between elements determine the efficiency of Bubble Sort algorithm.Read more »
quick SORT
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