Indrajeet Nikam

An in-place sorting algorithm that finds min. element in each cycle and puts it in appropriate position in list.

A Divide and Conquer algorithm that divides the list in two sub-lists and calls itself onto them recursively till it can't be split and merges them afterwards in a sorted manner.

An algorithm that finds correct position for one element in each cycle. i.e, the position to which it belongs in sorted array.

An in-place sorting algorithm that finds max. element in each cycle and puts it in appropriate position in list by performing swapping adjacent elements.