/
reverseArray.ts
54 lines (45 loc) · 1.21 KB
/
reverseArray.ts
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
52
53
54
// Reverse Array
const reverse = (array: number[]) => {
const result = array
for (let i = 0; i < array.length / 2; i++) {
let temp1 = result.length - 1 - i
let temp2 = result[i]
result[i] = result[temp1]
result[temp1] = temp2
}
return result
}
const arr = [5, 6, 3, 1, 8, 9, 2]
console.log('Original Array => ', arr)
console.log('Reversed Array => ', reverse(arr))
// Prime 'Bilangan Prima'
const prime = (n: number) => {
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) {
return false
}
}
return true
}
const n = 19
console.log('Is Prime => ', prime(n))
// Binary Search
function binarySearch(arr, l, r, x) {
if (r >= l) {
let mid = l + Math.floor((r - l) / 2)
// If the element is present at the middle
// itself
if (arr[mid] == x) return mid
// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x)
// Else the element can only be present
// in right subarray
return binarySearch(arr, mid + 1, r, x)
}
// We reach here when element is not
// present in array
return -1
}
const arr2 = [5, 6, 3, 1, 8, 9, 2]
console.log('Original Array => ', arr2)