Add TagSort (Index Sort) algorithm with tests#7366
Open
saidyanak wants to merge 1 commit intoTheAlgorithms:masterfrom
Open
Add TagSort (Index Sort) algorithm with tests#7366saidyanak wants to merge 1 commit intoTheAlgorithms:masterfrom
saidyanak wants to merge 1 commit intoTheAlgorithms:masterfrom
Conversation
Tag Sort (Index Sort) creates an array of sorted indices without modifying the original array. Useful when original positions need to be preserved. Time complexity: O(n log n), Space complexity: O(n).
saidyanak
requested review from
DenizAltunkapan,
alxkm and
yanglbme
as code owners
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
1 participant
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.
Description
Adds Tag Sort (also known as Index Sort or Dictionary Sort) to the sorts package.
Algorithm Overview
Tag Sort creates an array of indices (tags) and sorts those indices based on corresponding values in the original array. This is useful when the original positions of elements need to be preserved after sorting.
Complexity
Features
SortAlgorithminterfacegetSortedTags()method to retrieve sorted indices without modifying the original arrayReferences