Added solution for bubblesort in javascript#1196
Merged
ghostmkg merged 1 commit intoghostmkg:mainfrom Oct 31, 2025
Merged
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
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.
Bubble sort in JavaScript is a simple comparison-based algorithm that repeatedly scans the array, swaps adjacent out-of-order elements, and stops early if a full pass makes no swaps, ensuring the largest items “bubble” to the end each pass.
What it does
Compares neighboring pairs left-to-right and swaps if the left value is greater for ascending order.
After each pass, the last unsorted position holds the maximum element, shrinking the inner loop range.
An optimization tracks whether any swap occurred; if none, the array is already sorted and the algorithm terminates.