gaspersic/coding-interview-university
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Updated queues.

Browse Source
This commit is contained in:
John Washam 2016-06-19 18:05:27 -07:00
parent b6b1203a31
commit 5084c9a2de
1 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
plan.txt
View File

@ -213,15 +213,15 @@ Then test it out on a computer to make sure it's not buggy from syntax.
- Description: https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists - Description: https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists
- No need to implement - No need to implement
* - Stacks * - Stacks
- https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks * - https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks
- https://class.coursera.org/algs4partI-010/lecture/18 * - https://class.coursera.org/algs4partI-010/lecture/18
- https://class.coursera.org/algs4partI-010/lecture/19 * - https://class.coursera.org/algs4partI-010/lecture/19
- https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html * - https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html
- Will not implement. Implementing with array is trivial. * - Will not implement. Implementing with array is trivial.
Queues Queues
- https://class.coursera.org/algs4partI-010/lecture/20 * - https://class.coursera.org/algs4partI-010/lecture/20
- https://www.coursera.org/learn/data-structures/lecture/EShpq/queue * - https://www.coursera.org/learn/data-structures/lecture/EShpq/queue
- Circular buffer/FIFO: https://en.wikipedia.org/wiki/Circular_buffer * - Circular buffer/FIFO: https://en.wikipedia.org/wiki/Circular_buffer
- Implement using linked-list, with tail pointer: - Implement using linked-list, with tail pointer:
- enqueue(value) - adds value at position at tail - enqueue(value) - adds value at position at tail
- dequeue() - returns value and removes least recently added element (front) - dequeue() - returns value and removes least recently added element (front)
@ -230,7 +230,8 @@ Queues
- enqueue(value) - adds item at end of available storage - enqueue(value) - adds item at end of available storage
- dequeue() - returns value and removes least recently added element - dequeue() - returns value and removes least recently added element
- empty() - empty()
- Cost: - full()
* - Cost:
- a bad implementation using linked list where you enqueue at head and dequeue at tail would be O(n) - a bad implementation using linked list where you enqueue at head and dequeue at tail would be O(n)
because you'd need the next to last element, causing a full traversal each dequeue because you'd need the next to last element, causing a full traversal each dequeue
enqueue: O(1) (linked list and array) enqueue: O(1) (linked list and array)