Refactor bubble sort for improved efficiency#15
Open
Akesh-28 wants to merge 1 commit intoRekhuGopal:mainfrom
Open
Refactor bubble sort for improved efficiency#15Akesh-28 wants to merge 1 commit intoRekhuGopal:mainfrom
Akesh-28 wants to merge 1 commit intoRekhuGopal:mainfrom
Conversation
Refactor bubble sort algorithm to improve efficiency by reducing the range of each pass based on the last swap position.
Author
|
This is my first open-source contribution. |
| new_n=0 # Stores the index of the last swap in this pass | ||
| for i in range(1,n): | ||
| if(arr[i-1]>arr[i]): # Check if adjacent elements are in wrong order | ||
| arr[i],arr[i-1]=arr[i-1],arr[i] #swap the elements |
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.
Refactor bubble sort algorithm to improve efficiency by reducing the range of each pass based on the last swap position.