Skip to content

Commit 44b698d

Browse files
committed
fix : prettier fix
1 parent 5b37d3b commit 44b698d

File tree

2 files changed

+37
-38
lines changed

2 files changed

+37
-38
lines changed

search/exponential_search.ts

Lines changed: 33 additions & 34 deletions
Original file line numberDiff line numberDiff line change
@@ -13,38 +13,37 @@
1313
*/
1414

1515
export const exponentialSearch = (
16-
array: number[],
17-
x: number
18-
): number | null => {
19-
const arrayLength = array.length;
20-
if (arrayLength === 0) return null;
21-
22-
if (array[0] === x) return 0;
23-
24-
let i = 1;
25-
while (i < arrayLength && array[i] <= x) {
26-
i = i * 2;
27-
}
28-
29-
return binarySearch(array, x, i / 2, Math.min(i, arrayLength - 1));
30-
};
31-
32-
const binarySearch = (
33-
array: number[],
34-
x: number,
35-
start: number,
36-
end: number
37-
): number | null => {
38-
while (start <= end) {
39-
const mid = Math.floor((start + end) / 2);
40-
if (array[mid] === x) {
41-
return mid;
42-
} else if (array[mid] < x) {
43-
start = mid + 1;
44-
} else {
45-
end = mid - 1;
46-
}
16+
array: number[],
17+
x: number
18+
): number | null => {
19+
const arrayLength = array.length
20+
if (arrayLength === 0) return null
21+
22+
if (array[0] === x) return 0
23+
24+
let i = 1
25+
while (i < arrayLength && array[i] <= x) {
26+
i = i * 2
27+
}
28+
29+
return binarySearch(array, x, i / 2, Math.min(i, arrayLength - 1))
30+
}
31+
32+
const binarySearch = (
33+
array: number[],
34+
x: number,
35+
start: number,
36+
end: number
37+
): number | null => {
38+
while (start <= end) {
39+
const mid = Math.floor((start + end) / 2)
40+
if (array[mid] === x) {
41+
return mid
42+
} else if (array[mid] < x) {
43+
start = mid + 1
44+
} else {
45+
end = mid - 1
4746
}
48-
return null;
49-
};
50-
47+
}
48+
return null
49+
}

search/test/exponential_search.test.ts

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import { exponentialSearch } from '../exponential_search';
1+
import { exponentialSearch } from '../exponential_search'
22

33
describe('Exponential search', () => {
44
test.each([
@@ -13,7 +13,7 @@ describe('Exponential search', () => {
1313
])(
1414
'of %o, searching for %o, expected %i',
1515
(array: number[], target: number, expected: number | null) => {
16-
expect(exponentialSearch(array, target)).toBe(expected);
16+
expect(exponentialSearch(array, target)).toBe(expected)
1717
}
18-
);
19-
});
18+
)
19+
})

0 commit comments

Comments
 (0)