Built site for gh-pages

Author: apiad

.nojekyll

@@ -1 +1 @@
-007d49aa
+b76563c3

01_search.html

@@ -128,6 +128,18 @@
   <a href="./01_search.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text"><span class="chapter-number">1</span>&nbsp; <span class="chapter-title">Basic Search</span></span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="./02_binary.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text"><span class="chapter-number">2</span>&nbsp; <span class="chapter-title">Efficient Search</span></span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="./03_sort.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text"><span class="chapter-number">3</span>&nbsp; <span class="chapter-title">basic Sorting</span></span></a>
+  </div>
 </li>
       </ul>
   </li>
@@ -141,6 +153,10 @@
   </li>
         <li class="sidebar-item sidebar-item-section">
       <span class="sidebar-item-text sidebar-link text-start">
+ <span class="menu-text">String Matching</span></span>
+  </li>
+        <li class="sidebar-item sidebar-item-section">
+      <span class="sidebar-item-text sidebar-link text-start">
  <span class="menu-text">Graphs</span></span>
   </li>
         <li class="sidebar-item sidebar-item-section">
@@ -224,6 +240,7 @@ <h2 class="anchored" data-anchor-id="content-of-the-book">Content of the Book</h
 <li><strong>Searching and Sorting</strong>: We establish the core intuitions of algorithmic efficiency by exploring how to find and organize data in linear and logarithmic time.</li>
 <li><strong>Fundamental Data Structures</strong>: We implement essential abstractions—including linked lists, stacks, queues, and hash tables—that serve as the building blocks for more complex systems.</li>
 <li><strong>Trees</strong>: This part covers hierarchical data, from binary search trees to self-balancing structures and specialized variants like heaps and tries.</li>
+<li><strong>String Algorithms</strong>: We focus on pattern matching and text processing, covering algorithms from exact matching (KMP, Boyer-Moore) to advanced suffix structures.</li>
 <li><strong>Graphs</strong>: A significant section dedicated to relational data, covering traversals, shortest paths, spanning trees, and flow networks.</li>
 <li><strong>Dynamic Programming and Greedy Algorithms</strong>: We delve into powerful paradigms for solving optimization problems by exploiting subproblem structure and local optimality.</li>
 <li><strong>Specialized Domains</strong>: We explore deep subregions of Computer Science, including computational geometry, number theory, and game theory.</li>