enhanced visibility for InsertionSort algorithm behavior #16
Conversation
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
added HeapSpot logic added printStatistics() => InsertionSort; HeapSpot
|
GREAT animated, but not all columns are highlighted green after sort
|
|
Maybe after sorting we can just color all elements in green and show sorted array with statistic for 2-3 seconds? |
|
I've added commit that fixes small bug with highlighting |
bruchdev
reviewed
Oct 17, 2024
There was a problem hiding this comment.
I think we need to change that if cycle in all algorithms
|
and it works? |
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.
improve visibility for InsertionSort algorithm behavior - for better visibility needed to add dynamic sleepingTime(because of this it's taking to long for the whole animation)
added new algorithm HeapSpot ( maybe to replace the InsertionSort)
added printStatistics() => InsertionSort; HeapSpot; (need to be discussed final output for all algorithms)