Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
0% Quality Score
Upvotes Received
0
Posts with Upvotes
0
Upvoting Members
0
Downvotes Received
1
Posts with Downvotes
1
Downvoting Members
1
0 Endorsements
~5K People Reached
Favorite Tags
c++ x 1
Member Avatar for Geek-Master
Member Avatar for aayushssinghal

i want to implement queue in scheme with out increasing the complexity of the algorithm. Right now for inserting an element at the end of the queue i need to travel through whole queue. that makes insertion O(N) process. pls help me with this.

-1
52