Sorting

 Posted on August 9, 2013  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

What is a sorting algorithm ?

A sorting algorithm is an algorithm that sorts the data into some order, say from ascending to descending.

The sorting problem
Input: Array of numbers , unsorted. Eg.

Output : Same numbers sorted in some order, say increasing order. Eg.

Classification of sorting algorithms
Sorting algorithm can be classified in various ways.

Comparison sorts vs non comparison sorts

Various sorts

kodeknight  Page  quicksort  selection-sort  binary-sort  shell-sort  sorting  radix-sort  merge-sort  Comparison Sort  insertion-sort 

Insertion sort

 Posted on July 30, 2013  (Last modified on August 7, 2020)  |  3 minutes  |  Kinshuk Chandra

The sorting problem Input: Array of numbers , unsorted. Eg. Output : Same numbers sorted in some order, say increasing order. Eg. Insertion sort: An efficient elementary sort method which places each element in it’s proper place among the elements which are already placed Pseudocode for selection sort Starts by considering the first two elements of the array data, if out of order, swap them  Consider the third element, insert it into the proper position among the first three elements. [Read More]
kodeknight  sorting  Comparison Sort  insertion-sort 

Selection Sort

 Posted on July 30, 2013  (Last modified on August 7, 2020)  |  3 minutes  |  Kinshuk Chandra

The sorting problem Input: Array of numbers , unsorted. Eg. Output : Same numbers sorted in some order, say increasing order. Eg. Selection Sort is a sorting algorithm that sorts data items into ascending or descending order, which comes under the category of in-place comparison sort. Pseudocode of selection sort Get the smallest element and put it in the first position Get the next smallest element and put it in the 2nd position …. [Read More]
cpp  kodeknight  c  array  Selection Sort  Sorting Algorithm  sorting arrays  sorting  In-place sorting  Data Structure  Comparison Sort  java