fixing formatting to avoid code/style workflow fail

Author: mohmmadAyesh

Search/BinarySearch.js

@@ -13,7 +13,7 @@
  * @param {number} low - The lower bound index of the search interval (default is 0).
  * @param {number} high - The upper bound index of the search interval (default is arr.length - 1).
  * @returns {number} - The index of the found element if present, otherwise -1.
-*/
+ */
 function binarySearchRecursive(arr, x, low = 0, high = arr.length - 1) {
  const mid = Math.floor(low + (high - low) / 2)
 
@@ -41,7 +41,7 @@ function binarySearchRecursive(arr, x, low = 0, high = arr.length - 1) {
  * @param {number} low - The lower bound index of the search interval (default is 0).
  * @param {number} high - The upper bound index of the search interval (default is arr.length - 1).
  * @returns {number} - The index of the found element if present, otherwise -1.
-*/
+ */
 function binarySearchIterative(arr, x, low = 0, high = arr.length - 1) {
  while (high >= low) {
  const mid = Math.floor(low + (high - low) / 2)

Search/ExponentialSearch.js

@@ -38,13 +38,13 @@ function binarySearch(arr, value, floor, ceiling) {
  return binarySearch(arr, value, mid + 1, ceiling)
  }
 }
-/** 
-* Exponential Search
-* @param {number[]} arr - The array to search within.
-* @param {number} length - The length of the array.
-* @param {number} value - The value to search for in the array.
-* @returns {number} - The index of the found element if present, otherwise -1.
-*/
+/**
+ * Exponential Search
+ * @param {number[]} arr - The array to search within.
+ * @param {number} length - The length of the array.
+ * @param {number} value - The value to search for in the array.
+ * @returns {number} - The index of the found element if present, otherwise -1.
+ */
 function exponentialSearch(arr, length, value) {
  // If value is the first element of the array return this position
  if (arr[0] === value) {

Search/QuickSelectSearch.js

@@ -13,7 +13,7 @@
  */
 /**
  * @function quickSelectSearch
-* @param {number[]} array - The array of numbers to select the `k` smallest elements from.
+ * @param {number[]} array - The array of numbers to select the `k` smallest elements from.
  * @param {number} k - The number of smallest elements to select.
  * @returns {number[]} - A slice of the `k` smallest elements from the array.
  * @throws {Error} - Throws an error if the array is empty or if `k` is greater than or equal to the array length.

Search/RabinKarp.js

@@ -13,7 +13,7 @@
  * [Reference](https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm)
  */
 /**
-* @param {string} text - The text string in which to search for the pattern.
+ * @param {string} text - The text string in which to search for the pattern.
  * @param {string} pattern - The pattern string to search for in the text.
  * @returns {number[]} - An array of indices where the pattern is found in the text. Returns an empty array if the pattern is not found.
  *
@@ -26,7 +26,7 @@
  *
  * @see {@link https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm}
  */
- 
+
 const BASE = 256 // The number of characters in the alphabet
 const MOD = 997 // A prime number used for the hash function
 

Search/TernarySearch.js

@@ -11,14 +11,14 @@
  * Reference: https://www.geeksforgeeks.org/ternary-search/
  */
 /**
- * 
+ *
  * @param {number[]} arr - The sorted array to search in.
  * @param {number} key - The key to search for.
  * @param {number} [low=0] - The lowest index of the search range.
  * @param {number} [high=arr.length - 1] - The highest index of the search range.
  * @returns {number} - The index of the key if found, otherwise -1.
- */ 
- 
+ */
+
 function ternarySearchRecursive(arr, key, low = 0, high = arr.length - 1) {
  if (high >= low) {
  // find the mid1 and mid2
@@ -54,13 +54,13 @@ function ternarySearchRecursive(arr, key, low = 0, high = arr.length - 1) {
  return -1
  }
 }
-/** 
-* @param {number[]} arr - The sorted array to search in.
-* @param {number} key - The key to search for.
-* @param {number} [low=0] - The lowest index of the search range.
-* @param {number} [high=arr.length - 1] - The highest index of the search range.
-* @returns {number} - The index of the key if found, otherwise -1.
-*/
+/**
+ * @param {number[]} arr - The sorted array to search in.
+ * @param {number} key - The key to search for.
+ * @param {number} [low=0] - The lowest index of the search range.
+ * @param {number} [high=arr.length - 1] - The highest index of the search range.
+ * @returns {number} - The index of the key if found, otherwise -1.
+ */
 function ternarySearchIterative(arr, key, low = 0, high = arr.length - 1) {
  while (high >= low) {
  // find the mid1 and mid2