Added Circular array documentation #1841
Merged
Conversation
This file contains 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
|
Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊 |
⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀
|
ajay-dhangar
added
gssoc-ext
ajay-dhangar
requested changes
Nov 6, 2024
|
@ajay-dhangar please check once |
|
🎉🎉 Thank you for your contribution! Your PR #1841 has been merged! 🎉🎉 |
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.
📥 Pull Request
Description
The circular array, or circular buffer, is a linear data structure that wraps around to the beginning once it reaches the end, allowing efficient use of memory by reusing space without reallocating the array. It operates with a fixed size and is commonly utilized in queue implementations and buffering systems. Key operations include initialization, insertion (enqueue), deletion (dequeue), and checking the full or empty status. The provided implementations in Python, Java, and C++ demonstrate how to manage the circular nature of the array while maintaining optimal performance for these operations. The time complexity for enqueueing and dequeueing is (O(1)), while the space complexity is (O(n)), where (n) is the fixed size of the array.
Fixes #1817
Type of change
Checklist: