Selection Sort
An in-place sorting algorithm that finds min. element in each cycle and puts it in appropriate position in list.
Read more...
Merge Sort
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.
Read more...Insertion Sort
An algorithm that finds correct position for one element in each cycle. i.e, the position to which it belongs in sorted array.
Read more...Bubble Sort
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.
Read more...Linear Search
Linear search is used to find a particular element in a list or collection of items.
Target element is compared sequentially with each element of a collection until it is found. Otherwise it will traverse through that list until it reaches to the end of the list.
Read more...