From ff38b4a227ce7eedfe66651b71f11d70ef664623 Mon Sep 17 00:00:00 2001 From: Harshil Date: Tue, 2 Oct 2018 11:06:02 +0200 Subject: [PATCH] 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! --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index a2fc3a545..422bc9f68 100644 --- a/README.md +++ b/README.md @@ -87,7 +87,7 @@ __Properties__ Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort) -[Complexity Graphs](https://github.com/prateekiiest/Python/blob/master/sorts/sortinggraphs.png) +![Complexity Graphs](https://github.com/prateekiiest/Python/blob/master/sorts/sortinggraphs.png) 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.