Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

New Sorting Algorithms #61

Open
wants to merge 8 commits into
base: master
Choose a base branch
from
Open

New Sorting Algorithms #61

wants to merge 8 commits into from

Conversation

McDude73
Copy link

@McDude73 McDude73 commented Jun 12, 2020

Implemented new sorts, more to come.
Each have descriptions in the files of how they should work.

Implemented two new sorts:
(Iterative Merge Sort)
(Iterative Quick Sort)
Each have descriptions in the files of how they should work.
@McDude73 McDude73 changed the title 2 New Sorts 2 New Sorts (Iterative Merge & Iterative Quick) Jun 12, 2020
@MusicTheorist MusicTheorist added enhancement New feature or request needstime Issue will be fixed in the future labels Jun 12, 2020
Added More Sorts for the Visualizer
@McDude73 McDude73 changed the title 2 New Sorts (Iterative Merge & Iterative Quick) New Sorting Algorithms Jun 14, 2020
Added 4 new sorts (Inverse Grate, Reverse Grate, Bozo, Modulo)
Fixed the descriptions for some of the newly created sorts.
Changed Iterative Merge and Quick to support the Run All Sorts option.
Slope Sort was used in the Run All Exchange Sorts file, so this was fixed.
@Gaming32
Copy link

@McDude73 The ArrayV repo has been moved to https://github.com/gaming32/ArrayV-v4.0. If you wish to have your sorting algorithms added, please create a pull request on that repo.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request needstime Issue will be fixed in the future
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants