Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

BubbleSort needs optimization for best-case scenario #1626

Open
wassim31 opened this issue Aug 2, 2021 · 1 comment
Open

BubbleSort needs optimization for best-case scenario #1626

wassim31 opened this issue Aug 2, 2021 · 1 comment

Comments

@wassim31
Copy link

wassim31 commented Aug 2, 2021

in bubblesort.c , the program needs improvement , for best case scenario where the array is sorted , we don't need to process each element again.
So from O(n²) we gonna have O(n) time complexity.
Also , it needs a lot of code design improvement.
@Gaurav12477
Copy link

can I do this ?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@wassim31 @Gaurav12477