Update tests mergeSort,binarySearch

- More logging and descriptions of concepts are being added to DSA
  related tests with styles for mo' bitchen console loggin'

Author: travisjupp

data-structures/sorting-algos/binarySearch.js

@@ -22,6 +22,7 @@ export const binarySearchIterative = (arr, targetVal) => {
       rightPointer = midIdx;
     }
   }
+  console.log('targetVal not found');
   return null;
 };
 
@@ -49,6 +50,7 @@ export const binarySearchRecursive = (arr, targetVal, leftPointer = 0, rightPoin
       return binarySearchRecursive(arr, targetVal, leftPointer, rightPointer);
     }
   }
+  console.log('targetVal not found');
   return null;
 }
 

data-structures/sorting-algos/binarySearch.test.js

@@ -16,7 +16,6 @@ const jestConsole = console;
 beforeEach(() => {
   global.console = console;
   console.log(style.color(255,0,255),'▷',style.reset,style.color(39),expect.getState().currentTestName,style.reset);
-  // console.log(expect.getState());
 });
 
 afterEach(() => {
@@ -190,7 +189,7 @@ ${style.h2('## Steps')}
   });
 
   // BINARY SEARCH (RECURSIVE)
-  describe(`${style.underline}${style.italic}binarySearch (Recursive)\n${style.reset}`, () => {
+  describe(`${style.underline}${style.italic}(Recursive)\n${style.reset}`, () => {
 
     logItDescription('should find index of target AT END of a 4 element searchable', () => {
       const searchable = [2, 4, 6, 8];

data-structures/sorting-algos/mergeSort.test.js

@@ -26,8 +26,58 @@ afterEach(() => {
   console.log(style.color(99), style.hr.double, style.reset);
 });
 
+const logItDescription = (description, callback) => {
+  it(description, async () => {
+    // Array to store captured log messages for this specific test
+    const capturedLogs = [];
+    
+    // Spy on console.log and push messages to our array
+    const logSpy = jest.spyOn(console, 'log').mockImplementation((...args) => {
+      capturedLogs.push(args);
+    });
+
+    // Capture console.log output during the test's execution
+    try {
+      await callback(); // Assuming the callback might be async
+    } finally {
+      // Restore the original console.log behavior
+      logSpy.mockRestore();
+
+      // Print the custom description and then the captured logs
+      // console.log(style.green, ' ☞ ', style.reset, description);
+      capturedLogs.forEach(logArgs => {
+        console.log('   ↳ ', ...logArgs);
+      });
+    }
+  });
+};
+
 describe('mergeSort', () => {
-  it('should sort incrementally', () => {
+
+console.log(`
+${style.h1('# Merge Sort')}
+Breaks a list into smaller parts to simplify sorting
+
+${style.h2('## Time Complexity')}
+Ο(N * log N)  Ω(N * log N)  Θ(N * log N)  
+
+${style.h2('## Notes')}
+- created in 1945 by John von Neumann
+- average, best, and worst case complexity are equal due to
+  the same steps being taken regardless of the input (order and length).
+- _divide-and-conquer alorithm_
+- does not mutate original list
+- base case of recursive splitting function is when \`arr.length = 1\`
+
+${style.h2('## Steps')}
+The \`log N\` part:
+- recursively split input list down to single-element lists
+
+The \`N\` part:
+- merge and sort the single-element lists until the originial input size is acheived
+    `);
+
+  logItDescription('should sort incrementally', () => {
     console.log(mergeSort([5, 10, -3, -3, 7, 9]));
     expect(mergeSort([5, 10, -3, -3, 7, 9]))
       .toStrictEqual([-3, -3, 5, 7, 9, 10])

styles.js

@@ -46,6 +46,12 @@ const style = {
   h4: (text) => {
     return `${style.bold}${style.blue}${text}${style.reset}`;
   },
+  h5: (text) => {
+    return `${style.underline}${style.green}${text}${style.reset}`;
+  },
+  h6: (text) => {
+    return `${style.underline}${style.magenta}${text}${style.reset}`;
+  },
   chain: (...styles) => {
     let chainedStyles = '';
     for (const styleName of styles) {
@@ -126,7 +132,7 @@ const style = {
       style.hr.double,
       style.wrap('red', style.hr.single),
       style.wrap(style.color(255,0,255), style.hr.single),
-      style.wrap('\x1b[33m', style.hr.single),
+      style.wrap('\x1b[33m', style.hr.single)+'\n',
       style.wrap('italic', 'Make me ITALIC (reset included for `style.wrap()`)')+'\n'+
       style.wrap('black', 'redbg', 'bold', 'strike', 'Make me RED BACKGROUND STRIKED')+
       style.chain('red', 'bold')+ 'Make me RED BOLD'+ style.reset+'\n'+
@@ -162,7 +168,7 @@ SAMPLES (run \`styles.test()\` to view styled in console)
       style.hr.double,
       style.wrap('red', style.hr.single),
       style.wrap(style.color(255,0,255), style.hr.single),
-      style.wrap('\\x1b[33m', style.hr.single),
+      style.wrap('\\x1b[33m', style.hr.single)+'\\n',
 
       style.wrap('italic', 'Make me ITALIC (reset included for \`style.wrap()\`)')+'\\n'+
       style.wrap('black', 'redbg', 'bold', 'strike', 'Make me RED BACKGROUND STRIKED')+