chapter.ppt

Queue Model AbstractDataType Queue { instances ordered list of elements;one end is called the front; the other is the rear; operations Create(): Create an empty queue; IsEmpty(): Return true if queue is empty,return false otherwise; IsFull(): return true if queue is full, return false otherwise; First(): return first element of the queue; Last(): return last element of the queue; Add(x): add element x to the queue; Delete(x): delete front element from the queue and put it in x; } 3.4.2. Array Implementation of Queue A B C …… theArray: front back 0 1 2 n-1 X currentSize the queue size : currentSize; an empty queue has currentSize= = 0; an full queue has currentSize= = theArray.length; 3.4.2. Array Implementation of Queue To add an element: back=back+1; theArray[back]=x; To delete an element: two methods: 1) front=front+1; O(1) 2) shift the queue one position left. O(n) 3.4.2. Array Implementation of Queue front back front back front back A B C … B C … B C D … 3.4.2. Array Implementation of Queue … A B C D E Front back Free space 3.4.2. Array Implementation of Queue to use a circular array to represent a queue back C B A front back C B A front D Addtion 3.4.2. Array Implementation of Queue deletion C B A front D back deletion C B front back D 3.4.2. Array Implementation of Queue How implementation a circular array: When front or back reachs theArray.length-1, reset 0 2) back = (back+1) % theArray.length front = (front + 1) % theArray.length 3.4.2. Array Implementation of Queue Public class QueueAr { public QueueAr( ) public QueueAr( int capacity ) public boolean isEmpty( ){ return currentsize =