From ba6756c6ccd0571cde77b515cfb3d735bbeca988 Mon Sep 17 00:00:00 2001 From: vishvikkrishnan <44338064+vishvikkrishnan@users.noreply.github.com> Date: Fri, 25 Oct 2019 15:54:56 +0530 Subject: [PATCH] Fixed language and grammar error Polished the language and style of sentences and restructured the content under Merge sort for better understanding. --- guide/english/algorithms/index.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/guide/english/algorithms/index.md b/guide/english/algorithms/index.md index 217ca8702b855b..2267ea9bed80ae 100644 --- a/guide/english/algorithms/index.md +++ b/guide/english/algorithms/index.md @@ -19,12 +19,12 @@ Some common types of algorithms include sorting algorithms, search algorithms, a ### Efficiency -Algorithms are most commonly judged by their efficiency and the amount of computing resources they require to complete their task. A common way to evaluate an algorithm is to look at its time complexity. This shows how the running time of the algorithm grows as the input size grows. Since the algorithms today, have to be operate on large data inputs, it is essential for our algorithms to have a reasonably fast running time . +Algorithms are most commonly judged by their efficiency and the amount of computing resources they require to complete their task. A common way to evaluate an algorithm is to look at its time complexity. This shows how the running time of the algorithm grows as the input size grows. Since the algorithms today have to operate on large data inputs, it is essential for our algorithms to have a reasonably fast running time. ### Sorting Algorithms Sorting algorithms come in various flavors depending on your necessity. -Some, very common and widely used are: +Some very commonly and widely used ones are: #### Quick Sort @@ -32,7 +32,7 @@ There is no sorting discussion which can finish without quick sort. The basic co [Quick Sort](http://me.dt.in.th/page/Quicksort/) #### Merge Sort -It is the sorting algorithm which relies on the concept how to sorted arrays are merged to give one sorted arrays. Read more about it here- +It is a type of sorting algorithm which relies on the concept of repeated spitting and sorting of data arrays followed by merging to yield the final sorted array. Read more about it here: [Merge Sort](https://www.geeksforgeeks.org/merge-sort/) freeCodeCamp's curriculum heavily emphasizes creating algorithms. This is because learning algorithms is a good way to practice programming skills. Interviewers most commonly test candidates on algorithms during developer job interviews.