SELF DOUBT

Question

WE KNOW THAT ENQUEUE AND DQ TAKES O(1)  IN QUEUE INPLEMENTATION USING ARRAY 

SUPPOSE I WANT TO IMPLEMENT QUEUE USING ARRAY AND I HAVE A SCENARIO OF ARRAY

24

32

55

3

43

FRONT                                                                                                      REAR

NOW I DELETE 24 THEN IT WILL TAKE O(1) TO DELETE

32

55

3

43

                                FRONT                                                                  REAR

NOW I WANT TO INSERT 43 IT WILL SHOW OVERFlOW AS REAR+1==N SO 

MY DOBUT IS THAT WHILE DELETING 24 TO MAKE SPACE FOR ONE ELEMENT IF I SLIDE ALL TO LEFT POSITION THAN IT WILL TAKE O(N) TO SLIDE LEFT ...SO THE TIME COMPLEXITY TO DELETE AN ELEMENT IN QUEUE IS O(1)OR O(N)

Comments

Array should be circular.