Writes a generic data type for a deque and a randomized queue. A double-ended queue or deque (pronounced "deck") is a generalization of a stack and a queue that supports adding and removing items from either the front or the back of the data structure. A randomized queue is similar to a stack or queue, except that the item removed is chosen uniformly at random from items in the data structure.
-
Notifications
You must be signed in to change notification settings - Fork 0
Writes a generic data type for a deque and a randomized queue. A double-ended queue or deque (pronounced "deck") is a generalization of a stack and a queue that supports adding and removing items from either the front or the back of the data structure. A randomized queue is similar to a stack or queue, except that the item removed is chosen unif…
BLuEScioN/Randomized-Queues-and-Deques
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Writes a generic data type for a deque and a randomized queue. A double-ended queue or deque (pronounced "deck") is a generalization of a stack and a queue that supports adding and removing items from either the front or the back of the data structure. A randomized queue is similar to a stack or queue, except that the item removed is chosen unif…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published