Algorithm and Implementation Program of Quick Sort

Quick Sort is a Sorting Algorithm based on Divide And Conquer Technique. In this at every step element is placed in its proper position.It performs very well on a longer list. It works recursively, by first selecting a random "Pivot value" from the list. Then it partitions the...

selection sorting

 SELECTION SORT IN C++ Searching and sorting are popular in elementry data structures. Although now a days many advanced sorting techniques are used to sort a set of data, the basic sorting methods are still popular and are the used frequently. The algorithm works is selection sort works by finding the smallest element in the list and by assuming that we are doing...