[Sorting and Searching Algorithms]

Author: loiane

src/js/algorithms/sorting/radix-sort.js

@@ -1,8 +1,7 @@
 import { findMaxValue, findMinValue } from '../search/min-max-search';
 
-const getBucketIndex = (value, minValue, significantDigit, radixBase) => {
-  return Math.floor(((value - minValue) / significantDigit) % radixBase);
-};
+const getBucketIndex = (value, minValue, significantDigit, radixBase) =>
+  Math.floor(((value - minValue) / significantDigit) % radixBase);
 
 const countingSortForRadix = (array, radixBase, significantDigit, minValue) => {
   let bucketsIndex;

src/js/util.js

@@ -6,12 +6,12 @@ export const Compare = {
 
 export const DOES_NOT_EXIST = -1;
 
-export function lesserOrEquals(a, b, compareFn) {
+export function lesserEquals(a, b, compareFn) {
   const comp = compareFn(a, b);
   return comp === Compare.LESS_THAN || comp === Compare.EQUALS;
 }
 
-export function biggerOrEquals(a, b, compareFn) {
+export function biggerEquals(a, b, compareFn) {
   const comp = compareFn(a, b);
   return comp === Compare.BIGGER_THAN || comp === Compare.EQUALS;
 }