Register

sorting

2,932 views

1 Answer

0 0 votes

Counting Sort is used to sort n integers in the range 0 to n^3-1.

http://www.geeksforgeeks.org/sort-n-numbers-range-0-n2-1-linear-time/

Voting & Accepting an answer helps improve the community
← Previous · BAND MATRIXNext → · quick sort
← Previous in category · bucket osrtNext in category → · quick sort
Position:
Show:

Related questions

9 9 votes
6 6 answers
4.0k
4.0k views
Arjun asked Feb 27, 2025
3,967 views
GATE DA 2025 | Question: 19
Suppose that insertion sort is applied to the array $[1,3,5,7,9,11, x, 15,13]$ and it takes exactly two swaps to sort the array. Select all possible values of $x$.$10$$12...
1 1 vote
1 1 answer
143
143 views
GO Classes asked Aug 25
143 views
GO Classes DPP | GATE CS, DA | Algorithms | Sorting Complexity
Let $P$ be the problem of sorting $n\geq1$ elements using only comparisons.Consider the class of all comparison-based algorithms that correctly solve $P$.What is the asym...
2 2 votes
2 2 answers
190
190 views
GO Classes asked Aug 11
190 views
GO Classes DPP | GATE CS, DA | Algorithms | Sorting Comparison
Problem: Sort a file of huge records with tiny keys.Example application: Reorganize your MP-$3$ files.Which sorting method to use?a system sort, guaranteed to run in time...
1 1 vote
1 1 answer
126
126 views
GO Classes asked Aug 10
126 views
GO Classes DPP | GATE CS, DA | Algorithms | Non-Comparison Sorting
You need to sort hotels on a travel website according to their star rating.Which sorting algorithm would be the most appropriate?Insertion sort Merge sort Quicksort Bucke...