Sorting in linear time Implement of an algorithm that, given 𝑛 integers in the range 0 to 𝑘, preprocesses its input and then answers any query about how many of the 𝑛 integers fall into a range [𝑎..𝑏] in 𝑂(1) time. Your algorithm should use Θ(𝑛+𝑘) preprocessing time.
-
Notifications
You must be signed in to change notification settings - Fork 0
aysussozenn/Sorting-In-Linear-Time
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Sorting In Linear Time
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published