-
Notifications
You must be signed in to change notification settings - Fork 3
/
Find_the_middle_element.js
51 lines (41 loc) · 1.31 KB
/
Find_the_middle_element.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// Kata link:
// https://www.codewars.com/kata/545a4c5a61aa4c6916000755/
// -------------------------------------
// Instructions:
/*
As a part of this Kata, you need to create a function that when provided with
a triplet, returns the index of the numerical element that lies between the
other two elements.
The input to the function will be an array of three distinct numbers (Haskell: a tuple).
For example:
gimme([2, 3, 1]) => 0
2 is the number that fits between 1 and 3 and the index of 2 in the input array is 0.
Another example (just to make sure it is clear):
gimme([5, 10, 14]) => 1
10 is the number that fits between 5 and 14 and the index of 10 in the input array is 1.
*/
// -------------------------------------
// Solution 1:
let gimme = function (inputArray) {
for (let i = 0; i < inputArray.length; i++) {
if (
Math.min(...inputArray) !== inputArray[i] &&
Math.max(...inputArray) !== inputArray[i]
) {
return i;
}
}
};
// Solution 2:
//let gimme = function (inputArray) {
// return inputArray.indexOf(
// inputArray.concat().sort(function (a, b) {
// return a - b;
// })[1]
// );
//};
// -------------------------------------
// Basic Tests
console.log("Finds the index of middle element");
console.log(gimme([2, 3, 1]) === 0);
console.log(gimme([5, 10, 14]) === 1);