diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jaro-distance.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jaro-distance.english.md index 3228553354..8416d8d697 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jaro-distance.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jaro-distance.english.md @@ -6,21 +6,31 @@ challengeType: 5 ## Description
-The Jaro distance is a measure of similarity between two strings. The higher the Jaro distance for two strings is, the more similar the strings are. The score is normalized such that 0 equates to no similarity and 1 is an exact match. Definition The Jaro distance \( d_j \) of two given strings \(s_1\) and \(s_2\) is +The Jaro distance is a measure of similarity between two strings. The higher the Jaro distance for two strings is, the more similar the strings are. The score is normalized such that 0 equates to no similarity and 1 is an exact match. +Definition +The Jaro distance \( d_j \) of two given strings \(s_1\) and \(s_2\) is \begin{align}d_j = \begin{cases}0& & \text{if }m=0 \\\\{\frac {1}{3}}\left({\frac {m}{|s_{1}|}}+{\frac {m}{|s_{2}|}}+{\frac {m-t}{m}}\right)& & \text{otherwise}\end{cases}\end{align} - Where: +Where: + Two characters from \(s_1\) and \(s_2\) respectively, are considered matching only if they are the same and not farther than \(\left\lfloor\frac{\max(|s_1|,|s_2|)}{2}\right\rfloor-1\). Each character of \(s_1\) is compared with all its matching characters in \(s_2\) . The number of matching (but different sequence order) characters divided by 2 defines the number of transpositions. Example Given the strings \(s_1\) DWAYNE and \(s_2\) DUANE we find: - + We find a Jaro score of: \(d_j = \frac{1}{3}\left(\frac{4}{6} + \frac{4}{5} + \frac{4-0}{4}\right) = 0.822\). -Write a function a that takes two strings as parameters and returns the associated Jaro distance.
## Instructions
- +Write a function a that takes two strings as parameters and returns the associated Jaro distance.
## Tests @@ -53,7 +63,7 @@ tests:
```js -function jaro (s, t) { +function jaro(s, t) { // Good luck! } ``` @@ -67,7 +77,7 @@ function jaro (s, t) { ```js -function jaro (s, t) { +function jaro(s, t) { var s_len = s.length; var t_len = t.length; diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jortsort.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jortsort.english.md index 42fc3d4692..ff11fdac00 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jortsort.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/jortsort.english.md @@ -6,7 +6,7 @@ challengeType: 5 ## Description
-jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious JSConf. +jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious JSConf. jortSort is a function that takes a single array of comparable objects as its argument. It then sorts the array in ascending order and compares the sorted array to the originally provided array. If the arrays match (i.e. the original array was already sorted), the function returns true. If the arrays do not match (i.e. the original array was not sorted), the function returns false.
@@ -47,7 +47,7 @@ tests:
```js -function jortsort (array) { +function jortsort(array) { // Good luck! } ``` @@ -61,7 +61,7 @@ function jortsort (array) { ```js -function jortsort (array) { +function jortsort(array) { // sort the array var originalArray = array.slice(0); array.sort( function(a,b){return a - b} ); diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/josephus-problem.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/josephus-problem.english.md index fdb4ff568e..a92be3036c 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/josephus-problem.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/josephus-problem.english.md @@ -6,7 +6,7 @@ challengeType: 5 ## Description
-Josephus problem is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$. +Josephus problem is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$. An executioner walks along the circle, starting from prisoner $0$, removing every $k$-th prisoner and killing him. As the process goes on, the circle becomes smaller and smaller, until only one prisoner remains, who is then freed. For example, if there are $n=5$ prisoners and $k=2$, the order the prisoners are killed in (let's call it the "killing sequence") will be 1, 3, 0, and 4, and the survivor will be #2. @@ -14,12 +14,11 @@ Given any $n, k > 0$, find out which prisoner will be the final sur In one such incident, there were 41 prisoners and every 3rd prisoner was being killed ($k=3$). Among them was a clever chap name Josephus who worked out the problem, stood at the surviving position, and lived on to tell the tale. Which number was he? -Write a function that takes the initial number of prisoners and 'k' as parameter and returns the number of the prisoner that survives.
## Instructions
- +Write a function that takes the initial number of prisoners and 'k' as parameter and returns the number of the prisoner that survives.
## Tests @@ -52,7 +51,7 @@ tests:
```js -function josephus (init, kill) { +function josephus(init, kill) { // Good luck! } ``` @@ -68,7 +67,7 @@ function josephus (init, kill) { ```js -function josephus (init, kill) { +function josephus(init, kill) { var Josephus = { init: function(n) { this.head = {};