https://github.com/wwi2196/counting-sort-2-rank-sort

This project is a variation of the Counting Sort algorithm, influenced by the Rank Sort algorithm, where each element’s position in the sorted array is determined by counting the number of elements less than it.
https://github.com/wwi2196/counting-sort-2-rank-sort

Last synced: 3 months ago
JSON representation

This project is a variation of the Counting Sort algorithm, influenced by the Rank Sort algorithm, where each element’s position in the sorted array is determined by counting the number of elements less than it.

• Host: GitHub
• URL: https://github.com/wwi2196/counting-sort-2-rank-sort
• Owner: WWI2196
• License: apache-2.0
• Created: 2024-04-30T07:35:33.000Z (about 1 year ago)
• Default Branch: master
• Last Pushed: 2024-08-07T07:22:16.000Z (10 months ago)
• Last Synced: 2025-01-29T22:45:02.947Z (4 months ago)
• Language: C++
• Homepage:
• Size: 12.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.txt

Awesome Lists containing this project

README

        
# CountingSort Algorithm: A Variation of Rank Sort

This project implements a variation of the Counting Sort algorithm, which is closely related to the Rank Sort algorithm.

## Principle

The principle behind this variation is as follows: For each element of an array, 𝐴[𝑖], if there are 𝑘 elements less than A[i] in 𝐴[ ], then after the array is sorted, 𝐴[𝑖] will eventually be stored in 𝐴[𝑘]. This principle is a key aspect of the Rank Sort algorithm.

## Counting Sort Algorithm

The Counting Sort algorithm is based on the above principle. For each element of array 𝐴, count the total number of elements of 𝐴 that are less than it. This count determines the final index/position at which the element is to be stored in the sorted version of 𝐴. This is a direct application of the principle of Rank Sort, making this variation of Counting Sort closely related to Rank Sort.