fix: prettier fix TheAlgorithms#2

Fechuli · Fechuli · commit 6d55e80135a7 · 2024-08-04T23:02:23.000+02:00
diff --git a/search/exponential_search.ts b/search/exponential_search.ts
@@ -7,8 +7,8 @@ import { binarySearchIterative } from './binary_search'
  * where the value may be present and then performing a binary search within that range.
  *
  * Compared with binary search, exponential search can be more convenient and advantageous
- * in cases where the element to be searched is closer to the beginning of the array, 
- * thus avoiding several comparisons that would make the search more verbose. 
+ * in cases where the element to be searched is closer to the beginning of the array,
+ * thus avoiding several comparisons that would make the search more verbose.
  * Exponential search doubles the search time with each iteration.
  *
  * @param {number[]} array - sorted list of numbers

Original file line number	Diff line number	Diff line change
`@@ -7,8 +7,8 @@ import { binarySearchIterative } from './binary_search'`
`7`	`7`	`* where the value may be present and then performing a binary search within that range.`
`8`	`8`	`*`
`9`	`9`	`* Compared with binary search, exponential search can be more convenient and advantageous`
`10`		`- * in cases where the element to be searched is closer to the beginning of the array,`
`11`		`- * thus avoiding several comparisons that would make the search more verbose.`
	`10`	`+ * in cases where the element to be searched is closer to the beginning of the array,`
	`11`	`+ * thus avoiding several comparisons that would make the search more verbose.`
`12`	`12`	`* Exponential search doubles the search time with each iteration.`
`13`	`13`	`*`
`14`	`14`	`* @param {number[]} array - sorted list of numbers`