Skip to main content

Counting Sort in Javascript

Counting Sort — Perfect when you have psoitive integers to sort

Counting Sort for Unique Integer Values

function countingUniqueSort(arr)
{
  // set 1 for the index which is there in the input array
  const count = [];
  for (let i=0; i < arr.length; i++) {
    count[arr[i]] = 1;
  }
  // set indices over input array in order
  let j = 0;
  for (i=0; i<=count.length; i++) {
      if (count[i] === 1) {
        arr[j] = i;
        j++;
      }
  }
  return arr;
}

Counting Sort for possibly duplicate Integer Values

function countingSort(arr)
{
  // increase the value at the index which is there in the input array
  const count = [];
  for (let i=0; i < arr.length; i++) {
    if (count[arr[i]] > 0) {
      count[arr[i]]++;
    } else {
      count[arr[i]] = 1;
    }
  }
  // set indices over input array in order
  let j = 0;
  let k = 0;
  for (i=0; i<=count.length; i++) {
      k = count[i];
      while (k > 0) {
        arr[j] = i;
        j++;
        k--;
      }
  }
  return arr;
}

Test Input

console.log(`Original Array of Unique Elements: ${[3, 2, 5, 4, 8, 7]}`); 
console.log(`Sorted Array of Unique Elements: ${countingUniqueSort([3, 2, 5, 4, 8, 7])}`);

console.log(`Original Array Elements: ${[3, 2, 5, 5, 4, 8, 7]}`); 
console.log(`Sorted Array Elements: ${countingSort([3, 2, 5, 5, 4, 8, 7])}`);

Output

Original Array of Unique Elements: 3,2,5,4,8,7
Sorted Array of Unique Elements: 2,3,4,5,7,8
Original Array Elements: 3,2,5,5,4,8,7
Sorted Array Elements: 2,3,4,5,5,7,8

Comments

Popular posts from this blog

Python - Mathematical Functions - Hexadecimal, Binary, Exponential, Absolute, Round

🐍 Some mathematical functions are in-built in python. Here are some of them. Convert Decimal to Hexadecimal hex(246) Output: '0xf6' hex(512) Output: '0x200' 0x is prefix to all hexadecimal numbers in output. The number after 0x is the hexadecimal value. Convert Decimal to Binary bin(1234) Output: '0b10011010010' bin(246) Output: '0b11110110' bin(512) Output: '0b1000000000' Exponential Function pow() function is similar to num1**num2, but it comes useful when you want to execute (num1**num2)%num3. Passing three arguments to pow(), does this. pow(3,4) Output: 81 This works just like 3**4 pow(3,4,5) Output: 1 But this, works equivalent to (3**4)%5. Either of the two ways can be used. At this point I feel (3**4)%5 is better, as anybody reading the code will understand what is being done immediately. While with pow(2,3,4), the person may have to refer to documentation to understand how this function works. Absolute Value The function abs() is used ...

Two Ways of rendering in React Examples

Two Ways of rendering in React Examples 1 - Render twice HTML < div id = "p1" ></ div > < div id = "p2" ></ div > CSS . person { display : inline - block ; margin : 10px ; border : 1px solid # eee ; box - shadow : 0 2px 2px # ccc ; } JAVASCRIPT (Babel) function Person ( props ) { return ( < div className = ' person "> < h1 >{ props . name }</ h1 > < p > Age :{ props . age }</ p > </ div > ); } ReactDOM . render (< Person name = "VK" age = "29" />, document . querySselector ( '#p1' )); ReactDOM . render (< Person name = "HK" age = "28" />, document . querySselector ( '#p2' )); 2 Render all at once HTML < div id = "app" ></ div > CSS . person { display : inline - block ; margin : 1...

Binary Tree Traversal in Python - In Order, Pre Order, Post Order

Binary Tree Traversal in Python - In Order, Pre Order, Post Order Run the code here to see output:  https://repl.it/@VinitKhandelwal/iterative-traversal-of-binary-tree # Node Class to Create Object of Nodes class Node (): def __init__ ( self , value , left= None , right= None ): self .value = value self .left = left self .right = right # Creation of a Binary Tree class BinaryTree (): def __init__ ( self , mylist ): self .mylist = mylist self .root=Node ( None ) for value in self .mylist : self .curr= self .root self ._add ( value ) def _add ( self , value ): if self .curr.value == None : self .curr.value = value else : if self .curr.value > value : if self .curr.left == None : self .curr.left = Node ( value ) else : self .curr = self .curr.left self ._add ( value ) else : if self...