•Simple sorting algorithm
•Compares adjacent elements and swaps them if they are in the wrong order
•Array is split into sorted and an unsorted part
• Now sort the unsorted part, one item at a time,then add among the sorted part
•Keep finding minimum elememt and put in start
•Ultimately, in start we have sorted part in end we have unsorted part
•Finally, sorting completed
•Divide and Conquer algo
•Select a 'pivot' element from the array
•Partition other elements in two sub-arrays, on basis of less or greater from pivot
•Divide and Conquer algo
•Cut the given array into 2 sub-array, keep cutting, in last compare elements one with another
•Merge the two half arrays