<Li> Bubble sort: Exchange two adjacent elements if they are out of order . Repeat until array is sorted . </Li> <Li> Insertion sort: Scan successive elements for an out - of - order item, then insert the item in the proper place . </Li> <Li> Selection sort: Find the smallest element in the array, and put it in the proper place . Swap it with the value in the first position . Repeat until array is sorted . </Li> <Li> Quick sort: Partition the array into two segments . In the first segment, all elements are less than or equal to the pivot value . In the second segment, all elements are greater than or equal to the pivot value . Finally, sort the two segments recursively . </Li>

Sorting is the process of arranging a list of items into a defined order based on some criteria