Create StalinSort.cpp #235
Open
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
The Stalin Sort algorithm works by iterating through the input vector and removing any elements that are not in sorted order, keeping only the elements that are in order. In this implementation, we start by assuming that the first element in the vector is the largest and compare all subsequent elements to it. If an element is smaller than the current maximum, it is not in sorted order and is removed from the vector. Otherwise, it becomes the new maximum and is kept in the vector. The stalinSort function takes a reference to a vector of integers as input and modifies it in place to contain only the sorted elements. The main function creates an example vector, prints it to the console, sorts it using stalinSort, and prints the sorted vector to the console.
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.
The Stalin Sort algorithm works by iterating through the input vector and removing any elements that are not in sorted order, keeping only the elements that are in order. In this implementation, we start by assuming that the first element in the vector is the largest and compare all subsequent elements to it. If an element is smaller than the current maximum, it is not in sorted order and is removed from the vector. Otherwise, it becomes the new maximum and is kept in the vector.
The stalinSort function takes a reference to a vector of integers as input and modifies it in place to contain only the sorted elements. The main function creates an example vector, prints it to the console, sorts it using stalinSort, and prints the sorted vector to the console.