Add Reverse Method to Linear Data Structures#665
Open
arvinder004 wants to merge 8 commits into
Open
Conversation
Contributor
Author
|
@czgdp1807 @TripleCamellya sir please see this pr |
Contributor
Plz wait for discussion for API and implement with czgdp1807. I'm sorry that so far I'm just someone who is learning PyDS for GSoC. |
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
2 participants
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.
Fixes #664
This pull request introduces a reverse method to the pydatastructs library for linear data structures, starting with an implementation for the Array class in
linear_data_structures/algorithms.pyThe addition enhances the library's sequence manipulation capabilities by providing an in-place reversal operation for arrays, addressing a common need in algorithmic problem-solving and data processing.In the future, I will be adding similar reverse methods for other linear data structures:
LinkedList: Reverse the direction of pointers in-place.
Stack: Pop and push elements to create a reversed stack, potentially returning a new stack.
Queue: Reverse the order of elements, potentially returning a new queue.