From 286ef61b1aa1fdc1d8b68c20af03f4d2259994f2 Mon Sep 17 00:00:00 2001 From: Rajiv Ranjan Singh <42106787+iamrajiv@users.noreply.github.com> Date: Wed, 6 Mar 2019 03:57:24 +0530 Subject: [PATCH] Update index.md (#35517) --- guide/english/algorithms/index.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/guide/english/algorithms/index.md b/guide/english/algorithms/index.md index 9629056cde..5a243d3a0b 100644 --- a/guide/english/algorithms/index.md +++ b/guide/english/algorithms/index.md @@ -20,7 +20,7 @@ Some common types of algorithms include sorting algorithms, search algorithms, a There are different approaches used for writing an algorithm depending on the type of problem
  1. Brute force Approach: A straightforward approach to solving a problem,usually directly based on the problem statement and definitions of the concepts involved.
    2. -
  2. Divide and Conquer Approach: This approach works by recursively breaking down a problem into two or more sub-problems of the same or realted type,until these become simple enough to be solved directly.
    3. +
  3. Divide and Conquer Approach: This approach works by recursively breaking down a problem into two or more sub-problems of the same or related type,until these become simple enough to be solved directly.
  4. Decrease and Conquer Approach: This technique works by dividing a given problem into subproblem,finding the solutions to that subproblem,and finally extending solution of subproblem to arrive at the solution of original problem.
  5. Greedy Technique: Greedy approach solves a given problem by making a local optimal choice at each step which will lead to a globally-optimal solution.
  6. Backtracking: Backtracking can be defined as technique for solving problems recursively by trying to find a solution incrementally i.e. step by step and by removing those solutions that fail to satisfy the constraints of the problem at any point of time.
    7. @@ -40,7 +40,7 @@ Some, very common and widely used are: #### Quick Sort -There is no sorting discussion which can finish without quick sort. +There is no sorting discussion which can finish without quicksort. [Quick Sort](http://me.dt.in.th/page/Quicksort/) #### Merge Sort @@ -63,7 +63,7 @@ freeCodeCamp's curriculum heavily emphasizes creating algorithms. This is becaus This video gives an accessible and lively introduction to algorithms focusing on sorting and graph search algorithms. -[What is an Algorithm and Why Should you Care? | Khan Academy](https://www.youtube.com/watch?v=CvSOaYi89B4) +[What is an Algorithm and Why Should You Care? | Khan Academy](https://www.youtube.com/watch?v=CvSOaYi89B4) This video introduces algorithms and briefly discusses some high profile uses of them. @@ -73,7 +73,7 @@ This video demonstrates some popular sorting algorithms that are commonly taught [How algorithms shape our world | Kevin Slavin](https://www.youtube.com/watch?v=TDaFwnOiKVE) -This is a short video on how algorithms shape our world and their occurence in everyday life. +This is a short video on how algorithms shape our world and their occurrence in everyday life. [Algorithm Visualizer](http://algo-visualizer.jasonpark.me) @@ -85,7 +85,7 @@ This infographic shows you how unsupervised and supervised machine learning algo [Visualization of How Algorithms Work](https://visualgo.net/en) -This website has interactive visuals and elaborative explanations(pseudocode) of well known algorithms. +This website has interactive visuals and elaborative explanations(pseudocode) of well-known algorithms. [An entire course on Khanacademy on algorithms](https://www.khanacademy.org/computing/computer-science/algorithms)