searching and sorting

searching and sorting

1. sorting

   • bubble
     • 1) Bubble sorting Start at the beginning of the list.Compare the first value in the list with the next one up. If the first value is bigger, swap the positions of the two values. Move to the second value in the list. Keep going until there are no more items to compare. Go back to the start of the list. If you do 0 switches in a sort then your list is done
   • merge
     • Divide the unsorted array into subarray, each containing a single element. Take adjacent pairs of two single-element array and merge them to form an array of 2 elements. Repeat the process till a single sorted array is obtained.
   • insertion
     • If it is the first element, it is already sorted. Pick the next element. Compare with all the elements in sorted sub-list. Shift all the the elements in sorted sub-list that is greater than the value to be sorted. Insert the value. Repeat until list is sorted.