CP164 Lecture Notes - Lecture 6: Optical Fiber Cable, The Phone Company, Priority Queue
Document Summary
This is a sequence of items along with these methods: o 1) initialize: 2) is_empty o 3) insert, 4) remove, 5) peek, 6) length. In some languages, the array is of fixed size and if items removed from position 0, the hole remains. The circular array is how you, the programmer, thinks of the array; it is not an actual programming construct. How do we update front and rear: front=(front+1)%n
