Data structures
- A
- Queues A queue works like a line for an amusement park ride -- people enter at the end of the queue and leave from the front (FIFO: first in, first out).
var LimitedArray = function(limit) { | |
var storage = []; | |
var limitedArray = {}; | |
limitedArray.get = function(index) { | |
checkLimit(index); | |
return storage[index]; | |
}; | |
limitedArray.set = function(index, value) { | |
checkLimit(index); |
Let's explore the basics of using git alone and with a pair. Fork the Project
Def algorithm - The system or plan you use to arrive at a solution