8000 Merge pull request #186 from lostatseajoshua/patch-1 · codee/swift-algorithm-club@83fbcc3 · GitHub
[go: up one dir, main page]
Skip to content

Commit 83fbcc3

Browse files
kelvinlauKLkelvinlauKL
authored
Merge pull request kodecocodes#186 from lostatseajoshua/patch-1
Updated Bubble Sort description
2 parents 58bb5ef + 68f5819 commit 83fbcc3

File tree

1 file changed

+11
-1
lines changed

1 file changed

+11
-1
lines changed

‎Bubble Sort/README.markdown

Lines changed: 11 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,14 @@
11
# Bubble Sort
22

3-
This is a horrible algorithm. There is no reason why you should have to know it.
3+
Bubble sort is a sorting algorithm that is implemented by starting in the beginning of the array and swapping the first two elements only if the first element is greater than the second element. This comparison is then moved onto the next pair and so on and so forth. This is done until the the array is completely sorted. The smaller items slowly “bubble” up to the beginning of the array.
44

5+
##### Runtime:
6+
- Average: O(N^2)
7+
- Worst: O(N^2)
8+
9+
##### Memory:
10+
- O(1)
11+
12+
### Implementation:
13+
14+
The implementation will not be shown because as you can see from the average and worst runtimes this is a very inefficient algorithm but having a grasp of the concept will help in getting to know the basics of simple sorting algorithms.

0 commit comments

Comments
 (0)
0