typo: Exersice -> Exercise

cherouvim · cherouvim · commit 29206fc3b1ee · 2019-11-24T22:42:46.000+02:00
diff --git a/algorithms/binarySearch.md b/algorithms/binarySearch.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent Binary Search in an array
 
diff --git a/algorithms/countSort.md b/algorithms/countSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent CountingSort.
 
diff --git a/algorithms/heapify.md b/algorithms/heapify.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Create a maxHeap
 
diff --git a/algorithms/insertionSort.md b/algorithms/insertionSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent insertionSort.
 
diff --git a/algorithms/mergeSort.md b/algorithms/mergeSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent Merge Sort.
 
diff --git a/algorithms/quickSort.md b/algorithms/quickSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent QuickSort
 
diff --git a/algorithms/radixSort.md b/algorithms/radixSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent LSD (less-significant-bit) Radix Sort.
 
diff --git a/algorithms/selectionSort.md b/algorithms/selectionSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent Selection Sort.
 
diff --git a/exercises/exercise3.md b/exercises/exercise3.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Create nested object from multiple string paths
 
diff --git a/exercises/exercise4.md b/exercises/exercise4.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 For each of the following problems, give an algorithm that finds the desired numbers within the given amount of time. To keep your answers brief, feel free to use known algorithms as subroutines. For the example, S={6,13,19,3,8}, 19−3 maximizes the difference, while 8−6 minimizes the difference.
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-## Exersice`
	`1`	`+## Exercise`
`2`	`2`
`3`	`3`	`Implemenent Binary Search in an array`
`4`	`4`