Implemented Cocktail shaker algorithm in c++ #357
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.
Before opening a Pull Request, please read the following items:
Description
This C++ program implements the Cocktail Shaker Sort algorithm, a variation of Bubble Sort. It sorts a list of integers by traversing through the array in both directions—left-to-right and right-to-left—allowing it to quickly place unsorted elements into their correct positions. The algorithm continues alternating between these passes until no more swaps are needed, indicating that the array is sorted. This approach is particularly efficient for nearly sorted lists. The main function demonstrates sorting a sample array and outputs the sorted result.
Please add appropiate hacktoberFest 2024 tags
Thank you