From bebf7bd60d8110d10c5b9ac1799cfcd5ccd1b519 Mon Sep 17 00:00:00 2001 From: Harshvg2021 Date: Sat, 1 Oct 2022 23:27:41 +0530 Subject: [PATCH 1/2] Modified algorithm/sort.md --- algorithm/sort.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/algorithm/sort.md b/algorithm/sort.md index 02db4202..a1b6dae0 100644 --- a/algorithm/sort.md +++ b/algorithm/sort.md @@ -7,7 +7,7 @@ ```cpp void show(int a[]) { for(int i = 0; i < 10; ++i) - std::cout << a[i] << " "; + std::cout << a[i] << ' '; } int main() { From e0d0cc5b4b7bda5c0d531f410043d9c62dc03946 Mon Sep 17 00:00:00 2001 From: Harshvg2021 Date: Sat, 1 Oct 2022 23:55:43 +0530 Subject: [PATCH 2/2] Updated algorithm/sort.md --- algorithm/sort.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/algorithm/sort.md b/algorithm/sort.md index a1b6dae0..7e85248d 100644 --- a/algorithm/sort.md +++ b/algorithm/sort.md @@ -1,6 +1,6 @@ # sort -**Description :** This function is implemented as Quick-sort. The complexity of it is O(N*log(N)). +**Description :** This function is implemented using Intro-Sort (Insertion Sort + heap Sort + Quick Sort). The complexity of it is O(N*log(N)). **Example** :