examples and finalizing content

Author: DaveBerzack-NSS

src/chapters/sorting-and-binary-search/binary-search-fundamentals.js

@@ -1,10 +1,22 @@
 import content  from './text/binary-search-fundamentals-content.md?raw';
+import example from './text/binary-search-fundamentals-example.js?raw';
+import completed from './text/binary-search-fundamentals-completed.js?raw';
 
 export const binarySearchFundamentalsChapter = {
   id: 'binary-search-fundamentals',
   title: 'Binary Search Fundamentals',
   sectionId: 'sorting-and-binary-search',
   previousChapterId: 'sort-method',
   content: content,
-  exercise: null
+  exercise: {
+      starterCode: example,
+      solution: completed,
+      question: `
+  # Exercise Question
+      `,
+      solution_explanation: `
+  # Solution Explanation
+  it goes like this
+      `
+    }
 };

src/chapters/sorting-and-binary-search/binary-search-variants.js

@@ -1,10 +1,22 @@
 import content from './text/binary-search-variants-content.md?raw';
+import example from './text/binary-search-variants-example.js?raw';
+import completed from './text/binary-search-variants-completed.js?raw';
 
 export const binarySearchVariantsChapter = {
   id: 'binary-search-variants',
   title: 'Binary Search Variants',
   sectionId: 'sorting-and-binary-search',
   previousChapterId: 'binary-search-fundamentals',
   content: content,
-  exercise: null
+  exercise: {
+      starterCode: example,
+      solution: completed,
+      question: `
+  # Exercise Question
+      `,
+      solution_explanation: `
+  # Solution Explanation
+  it goes like this
+      `
+    }
 };

src/chapters/sorting-and-binary-search/sort-method.js

@@ -1,10 +1,22 @@
 import content  from './text/sort-method-content.md?raw';
+import example from './text/sort-method-example.js?raw';
+import completed from './text/sort-method-completed.js?raw';
 
 export const sortMethodChapter = {
   id: 'sort-method',
   title: 'Using .sort() with Comparators',
   sectionId: 'sorting-and-binary-search',
   previousChapterId: 'sorting-approaches',
   content: content,
-  exercise: null
+  exercise: {
+      starterCode: example,
+      solution: completed,
+      question: `
+  # Exercise Question
+      `,
+      solution_explanation: `
+  # Solution Explanation
+  it goes like this
+      `
+    }
 };

src/chapters/sorting-and-binary-search/text/binary-search-fundamentals-completed.js

@@ -0,0 +1,36 @@
+
+// Customer asks for "Hotel" but the full title is "Hotel California"
+function findAlbumsStartingWith(sortedCollection, prefix) {
+  // Find the first album that starts with the prefix
+  let left = 0;
+  let right = sortedCollection.length - 1;
+  let firstMatch = -1;
+  
+  while (left <= right) {
+    const mid = Math.floor(left + (right - left) / 2);
+    const currentTitle = sortedCollection[mid].title;
+    
+    if (currentTitle.toLowerCase().startsWith(prefix.toLowerCase())) {
+      firstMatch = mid;
+      right = mid - 1; // Keep looking for earlier matches
+    } else if (currentTitle.toLowerCase() < prefix.toLowerCase()) {
+      left = mid + 1;
+    } else {
+      right = mid - 1;
+    }
+  }
+  
+  // Collect all albums starting with the prefix
+  const matches = [];
+  if (firstMatch !== -1) {
+    for (let i = firstMatch; i < sortedCollection.length; i++) {
+      if (sortedCollection[i].title.toLowerCase().startsWith(prefix.toLowerCase())) {
+        matches.push(sortedCollection[i]);
+      } else {
+        break;
+      }
+    }
+  }
+  
+  return matches;
+}

src/chapters/sorting-and-binary-search/text/binary-search-fundamentals-content.md

@@ -175,107 +175,14 @@ When implementing binary search, watch out for:
 
 5. **Duplicate Elements:** Standard binary search finds any matching element, not necessarily the first or last occurrence.
 
-## Binary Search Challenges at Groove Records
-
-As Sam implemented binary search in his daily operations, he encountered some practical challenges that taught Alex important lessons:
 
 ### Handling Partial Matches
-```javascript
-// Customer asks for "Hotel" but the full title is "Hotel California"
-function findAlbumsStartingWith(sortedCollection, prefix) {
-  // Find the first album that starts with the prefix
-  let left = 0;
-  let right = sortedCollection.length - 1;
-  let firstMatch = -1;
-  
-  while (left <= right) {
-    const mid = Math.floor(left + (right - left) / 2);
-    const currentTitle = sortedCollection[mid].title;
-    
-    if (currentTitle.toLowerCase().startsWith(prefix.toLowerCase())) {
-      firstMatch = mid;
-      right = mid - 1; // Keep looking for earlier matches
-    } else if (currentTitle.toLowerCase() < prefix.toLowerCase()) {
-      left = mid + 1;
-    } else {
-      right = mid - 1;
-    }
-  }
-  
-  // Collect all albums starting with the prefix
-  const matches = [];
-  if (firstMatch !== -1) {
-    for (let i = firstMatch; i < sortedCollection.length; i++) {
-      if (sortedCollection[i].title.toLowerCase().startsWith(prefix.toLowerCase())) {
-        matches.push(sortedCollection[i]);
-      } else {
-        break;
-      }
-    }
-  }
-  
-  return matches;
-}
-```
-
-### Case-Insensitive Search
-```javascript
-// Handle different capitalization in search terms
-function findAlbumCaseInsensitive(sortedCollection, targetTitle) {
-  let left = 0;
-  let right = sortedCollection.length - 1;
-  
-  while (left <= right) {
-    const mid = Math.floor(left + (right - left) / 2);
-    const currentTitle = sortedCollection[mid].title.toLowerCase();
-    const target = targetTitle.toLowerCase();
-    
-    if (currentTitle === target) {
-      return sortedCollection[mid];
-    } else if (currentTitle < target) {
-      left = mid + 1;
-    } else {
-      right = mid - 1;
-    }
-  }
-  
-  return null;
-}
-```
-
-### Price Range Searches
-
-```javascript
-// Find all albums in a specific price range
-function findAlbumsInPriceRange(collectionSortedByPrice, minPrice, maxPrice) {
-  // Find first album >= minPrice
-  const startIndex = findInsertionPoint(collectionSortedByPrice, minPrice, 'price');
-  // Find first album > maxPrice
-  const endIndex = findInsertionPoint(collectionSortedByPrice, maxPrice + 0.01, 'price');
-  
-  return collectionSortedByPrice.slice(startIndex, endIndex);
-}
-
-function findInsertionPoint(sortedCollection, targetValue, property) {
-  let left = 0;
-  let right = sortedCollection.length;
-  
-  while (left < right) {
-    const mid = Math.floor(left + (right - left) / 2);
-    if (sortedCollection[mid][property] < targetValue) {
-      left = mid + 1;
-    } else {
-      right = mid;
-    }
-  }
-  
-  return left;
-}
-```
 
 "Binary search isn't just about finding exact matches," Alex realized. "It's about efficiently navigating any sorted data to answer complex questions. The core principle stays the same - divide and conquer - but the implementation details matter for creating a great customer experience."
 
-Sam was delighted. "Now I can instantly answer customer questions like 'What albums do you have under $20?' or 'Show me everything from the 1980s.' My customers love how quickly I can help them!"
+Sam was delighted. "Now I can instantly answer all kinds of customer questions and sell more records!"
+
+Try out a new challenge in the exercise column. This is a difficult challenge, so try your best to follow the comments and implement that logic.
 
 ## Real-World Applications
 

src/chapters/sorting-and-binary-search/text/binary-search-fundamentals-example.js

@@ -0,0 +1,126 @@
+
+function findAlbumsStartingWith(sortedCollection, prefix) {
+
+  // start by setting left and right pointers to the first and last indices of our collection,
+  // set firstMatch to -1, a placeholder
+  
+  while (left <= right) {
+    
+    //set a variable called mid, to the middle index between our pointers
+    //set a variable currentTitle to the title property of the element at mid
+    
+    //check if that title starts with the specified prefix string (bonus: make it case insensitive)
+        //if so, set firstMatch to this element, then move the right pointer just left of mid to search for an earlier match
+        //if the currentTitle is before ( < ) the prefix, set left to right after mid to search the right half next
+        //otherwise, set right to just before mid to search the left half next
+  }
+  
+  // Collect all albums starting with the prefix
+  const matches = [];
+  if (firstMatch !== -1) {
+    //if we found at least one match, iterate through the collection starting with that and keep adding records as long as they start with the prefix
+  }
+  
+  return matches;
+}
+
+
+////// Some test data and calls to test out these functions
+const vinylCollection = [
+  {
+    title: "Abbey Road",
+    artist: "The Beatles",
+  },
+  {
+    title: "Back in Black",
+    artist: "AC/DC",
+  },
+  {
+    title: "Born to Run",
+    artist: "Bruce Springsteen",
+  },
+  {
+    title: "Born in the U.S.A.",
+    artist: "Bruce Springsteen",
+  },
+  {
+    title: "Brothers in Arms",
+    artist: "Dire Straits",
+  },
+  {
+    title: "Dark Side of the Moon",
+    artist: "Pink Floyd",
+  },
+  {
+    title: "Desperado",
+    artist: "Eagles",
+  },
+  {
+    title: "Fleetwood Mac",
+    artist: "Fleetwood Mac",
+  },
+  {
+    title: "Hotel California",
+    artist: "Eagles",
+  },
+  {
+    title: "Houses of the Holy",
+    artist: "Led Zeppelin",
+  },
+  {
+    title: "Hysteria",
+    artist: "Def Leppard",
+  },
+  {
+    title: "Led Zeppelin IV",
+    artist: "Led Zeppelin",
+  },
+  {
+    title: "Let It Be",
+    artist: "The Beatles",
+  },
+  {
+    title: "Let It Bleed",
+    artist: "The Rolling Stones",
+  },
+  {
+    title: "London Calling",
+    artist: "The Clash",
+  },
+  {
+    title: "Nevermind",
+    artist: "Nirvana",
+  },
+  {
+    title: "Physical Graffiti",
+    artist: "Led Zeppelin",
+  },
+  {
+    title: "Purple Rain",
+    artist: "Prince",
+  },
+  {
+    title: "Rumours",
+    artist: "Fleetwood Mac",
+  },
+  {
+    title: "Sgt. Pepper's Lonely Hearts Club Band",
+    artist: "The Beatles",
+  },
+  {
+    title: "The Wall",
+    artist: "Pink Floyd",
+  },
+  {
+    title: "Thriller",
+    artist: "Michael Jackson",
+  },
+  {
+    title: "Who's Next",
+    artist: "The Who",
+  }
+];
+
+// Customer asks for "ho" and should find Hotel California and Houses of the Holy
+const albums = findAlbumsStartingWith(vinylCollection, "ho");
+console.log(albums);