Update README.md

README.md

@@ -5,29 +5,29 @@ language:
 - en
 widget:
 - text: "Dijkstra's algorithm is an algorithm for finding the [MASK] paths between nodes in a weighted graph"
-  example_title: "example 6 - Djikstra"
+  example_title: "Djikstra"
   
 - text: "This concludes the [MASK]."
-  example_title: "example 0 a"
+  example_title: "0a"
   
 - text: "We show this by [MASK]."
-  example_title: "example 0 b"
+  example_title: "0b"
   
 - text: "By [MASK]'s inequality."
-  example_title: "example 7 - inequalities"
+  example_title: "inequalities"
   
 - text: "The [MASK] is definite positive."
-  example_title: "example 1"
+  example_title: "0c"
   
 - text: "* In particular any field is a [MASK]."
-  example_title: "example 2"
+  example_title: "0d"
   
 - text: "* To determine the shortest distance in a graph, one can use [MASK]'s algorithm."
-  example_title: "example 3 - algorithm specific"
+  example_title: "algorithm"
   
 - text: "* An illustration of the superiority of quantum computer is provided by [MASK]'s algorithm."
-  example_title: "example 4 - algorithm name"
+  example_title: " algorithm name"
   
 - text: "* One of the ways of avoiding [MASK] is using cross validation, that helps in estimating the error over test set, and in deciding what parameters work best for your model."
-  example_title: "example 5 - Machine learning"
+  example_title: "Machine learning"
 ---