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

done the required changes #1

Open
wants to merge 1 commit into
base: patch-2
Choose a base branch
from
Open

done the required changes #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions src/pages/algorithms/sorting-algorithms/bubble-sort/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -45,8 +45,8 @@ Now, the array is already sorted, but our algorithm does not know if it is compl
- Space complexity: O(1)
TIME COMPLEXITY:-
- Best case performance: O(n)
- Average case performance: O(n*n)
- Worst case performance: O(n*n)
- Average case performance: O(n<sup>2</sup>)
- Worst case performance: O(n<sup>2</sup>)
- Stable: Yes

### Video Explanation
Expand Down Expand Up @@ -74,8 +74,8 @@ while(!sorted) {
* Space Complexity: O(1)
* TIME COMPLEXITY:-
- Best case performance: O(n)
- Average case performance: O(n*n)
- Worst case performance: O(n*n)
- Average case performance: O(n<sup>2</sup>)
- Worst case performance: O(n<sup>2</sup>)
* In place: Yes
* Stable: Yes

Expand Down