Given an array of 100,000 pixel color values and each of which is an integer in the range (0,255). Give sorting algorithm.

We should use counting sort.

There are only 256 key value, so aux array will have only 256 values, and in O(n) time and 2 passes we will be able to sort in efficient way.

See also

• Given a binary search tree with 2 nodes swapped find number of pairs not following BST properties
• For a Given node of a binary tree, print the K distance nodes.
• Find the distance between 2 nodes in Binary Tree
• Find the distance between 2 nodes in Binary Tree
• Program to count leaf nodes in a binary tree