This is not bubble sort bubble sort take first element compare with every element and sort so it is called worst sorting technique how come no one recognised it?
Your code won't work if we add 2 elements from front, then 3 from rear...for resolving this issue, we have to check if front is equal to rear or not, in both functions...if yes, we will flash "queue is full"...and according to this program, we have to declare front as size-1, not -1, otherwise f-- won't give a valid index
