Implemented Queue using array#6682
Closed
alka-tripathi wants to merge 2 commits intoTheAlgorithms:masterfrom
Closed
Implemented Queue using array#6682alka-tripathi wants to merge 2 commits intoTheAlgorithms:masterfrom
alka-tripathi wants to merge 2 commits intoTheAlgorithms:masterfrom
Conversation
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## master #6682 +/- ##
=========================================
Coverage 77.82% 77.83%
Complexity 6392 6392
=========================================
Files 732 732
Lines 21320 21320
Branches 4182 4182
=========================================
+ Hits 16592 16594 +2
+ Misses 4059 4058 -1
+ Partials 669 668 -1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Member
|
@alka-tripathi Please fix the failing workflows so I can start the review. |
|
This pull request has been automatically closed because its workflows or checks failed and it has been inactive for more than 14 days. Please fix the workflows and reopen if you'd like to continue. Merging from main/master alone does not count as activity. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Purpose: Add an element at the end of the queue.
Behavior:
If the queue is full (isOverflow() returns true), it prints a message and does not add the element.
Otherwise, increments rear and stores the new element in the array.
Time Complexity: O(1)
Purpose: Remove the element from the front of the queue.
Behavior:
If the queue is empty (isEmpty() returns true), it prints a message and returns -1.
Otherwise, it removes the front element, shifts all remaining elements one step forward, and decrements rear.
Time Complexity: O(n) — due to shifting elements.
Purpose: Get the element at the front of the queue without removing it.
Behavior:
If the queue is empty, prints a message and returns -1.
Otherwise, returns the first element of the array.
Time Complexity: O(1)
Purpose: Check whether the queue has any elements.
Behavior:
Returns true if rear == -1 (no elements in the queue), otherwise false.
Use Case: Helps prevent errors when removing or peeking from an empty queue.
Purpose: Check whether the queue is full.
Behavior:
Returns true if rear == size - 1 (no more space to add elements), otherwise false.
Use Case: Helps prevent adding elements beyond the array size.
#5959 #queue #165