Sorting
Sort an array of size n containing integers between 1 and K, given a temporary scratch integer array of size K.
posted by Foobar @ 7:31 PM
Saturday, October 01, 2005
Collection of Puzzles.
Previous Posts
- Jar with the heaviest pill
- Burning Island
- Two condoms
- A dragon and knight
- Hummingbird
- Hats
- Why do you think you are smart
- The fork in the road
- Arabs and camels
- True or false
1 Comments:
Go through the array, everytime u see a number between 1 and k, increment the count in the scratch array indexed by k.
After it is done, go through the scratch array and seeing the count for 1, put so many 1's in the given array, replacing its original contents.
Post a Comment
<< Home