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 

Tower of Hanoi Problem

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

There are 3 pegs source ,auxillary and target. n disks of different sizes are given which can slide onto any peg . In the beginning all of the disks are in the source peg in the order of size with largest disk at the bottom and smallest disk at the top. We have to move all the disks from source peg to target peg such that in the end the target peg will have all the disks in the same order of size. [Read More]
kodeknight  recursion 

Binary tree - Types and Properties

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

Tree is sometimes binary tree (BT) and sometimes binary search tree(BST). BT has maximum of 2 child nodes. Binary Search Tree or Ordered tree(sometimes) is BT such that left child has value less than the parent and right child has value greater than parent. Strictly binary tree - If every non-leaf node in BT has non empty left and right subtrees. A / \ B C / \ D E [Read More]
Binary Tree  BT  kodeknight  binary-search-tree  BST