Skip to content

Commit ff38b4a

Browse files
authored
Minor edit
The image of Complexity Graphs was not visible due to a missing exclamation mark in the beginning. So, Just add it with this little commit!
1 parent ca99871 commit ff38b4a

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -87,7 +87,7 @@ __Properties__
8787

8888
Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort)
8989

90-
[Complexity Graphs](https://github.com/prateekiiest/Python/blob/master/sorts/sortinggraphs.png)
90+
![Complexity Graphs](https://github.com/prateekiiest/Python/blob/master/sorts/sortinggraphs.png)
9191

9292
Choosing of a sort technique-Quicksort is a very fast algorithm but can be pretty tricky to implement ,Bubble sort is a slow algorithm but is very easy to implement. To sort small sets of data, bubble sort may be a better option since it can be implemented quickly, but for larger datasets, the speedup from quicksort might be worth the trouble implementing the algorithm.
9393

0 commit comments

Comments
 (0)