From 0969a685d5ee55064ad5d18860e6937c7c340e17 Mon Sep 17 00:00:00 2001 From: Fakabbir Amin Date: Sun, 4 Jun 2017 17:03:07 +0530 Subject: [PATCH 1/3] Add documentation for Sorting This is an initial commit, further improvement will be added soon --- Sorting/readme.md | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 Sorting/readme.md diff --git a/Sorting/readme.md b/Sorting/readme.md new file mode 100644 index 00000000..2ac449d2 --- /dev/null +++ b/Sorting/readme.md @@ -0,0 +1,12 @@ +# Sorting Algorithms +Sorting Algorithms are one among the important algortihms because of the fact that it could reduce the complexity of the requiered operations after the processing to very effective. The simple example being searching. for an unordered list the time complextity of the most effective algoritm would be of the order O(n). While after sorting the complexity could be reduced to the order of $$O(log_{2}n)$$. Sorting refers to arranging data $$a_1 , a_2, a_3, ...., a_i ,..... a_n$$ such that for every indexing parameter $$i \geq j $$ , a_i > a_j $$. Most common ordering is based on lexicographical ordeer or numerical order. +Below is the list of variuos sorting algorithms : +* Bubble Sort +* Counting Sort +* Heap Sort +* Insertion Sort +* Merge Sort +* Quick Sort +* Selection Sort +* Shell Sort + From dac18777b1a0839163dc15e0b8bc1b042caf4bec Mon Sep 17 00:00:00 2001 From: Fakabbir Amin Date: Sun, 4 Jun 2017 17:06:04 +0530 Subject: [PATCH 2/3] Update readme.md --- Sorting/readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Sorting/readme.md b/Sorting/readme.md index 2ac449d2..adf2869d 100644 --- a/Sorting/readme.md +++ b/Sorting/readme.md @@ -1,5 +1,5 @@ # Sorting Algorithms -Sorting Algorithms are one among the important algortihms because of the fact that it could reduce the complexity of the requiered operations after the processing to very effective. The simple example being searching. for an unordered list the time complextity of the most effective algoritm would be of the order O(n). While after sorting the complexity could be reduced to the order of $$O(log_{2}n)$$. Sorting refers to arranging data $$a_1 , a_2, a_3, ...., a_i ,..... a_n$$ such that for every indexing parameter $$i \geq j $$ , a_i > a_j $$. Most common ordering is based on lexicographical ordeer or numerical order. +Sorting Algorithms are one among the important algortihms because of the fact that it could reduce the complexity of the requiered operations after the processing to very effective. The simple example being searching. for an unordered list the time complextity of the most effective algoritm would be of the order O(n). While after sorting the complexity could be reduced to the order of log (n). Sorting refers to arranging data a_1 , a_2, a_3, ...., a_i ,..... a_n such that for every indexing parameter i > j , a_i > a_j . Most common ordering is based on lexicographical ordeer or numerical order. Below is the list of variuos sorting algorithms : * Bubble Sort * Counting Sort From 6ce081e7c85e6e78dbadc38c8123400875a6aaea Mon Sep 17 00:00:00 2001 From: Fakabbir Amin Date: Sun, 4 Jun 2017 17:06:57 +0530 Subject: [PATCH 3/3] Update readme.md --- Sorting/readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Sorting/readme.md b/Sorting/readme.md index adf2869d..50547712 100644 --- a/Sorting/readme.md +++ b/Sorting/readme.md @@ -1,5 +1,5 @@ # Sorting Algorithms -Sorting Algorithms are one among the important algortihms because of the fact that it could reduce the complexity of the requiered operations after the processing to very effective. The simple example being searching. for an unordered list the time complextity of the most effective algoritm would be of the order O(n). While after sorting the complexity could be reduced to the order of log (n). Sorting refers to arranging data a_1 , a_2, a_3, ...., a_i ,..... a_n such that for every indexing parameter i > j , a_i > a_j . Most common ordering is based on lexicographical ordeer or numerical order. +Sorting Algorithms are one among the important algortihms because of the fact that it could reduce the complexity of the requiered operations after the processing to very effective. The simple example being searching. For an unordered list the time complextity of the most effective algoritm would be of the order O(n). While after sorting the complexity could be reduced to the order of log (n). Sorting refers to arranging data a_1 , a_2, a_3, ...., a_i ,..... a_n such that for every indexing parameter i > j , a_i > a_j . Most common ordering is based on lexicographical ordeer or numerical order. Below is the list of variuos sorting algorithms : * Bubble Sort * Counting Sort