Make search algorithms readable (#6741)

* Enhanced readability

By bolding some text and removing unnecessary or incorrect information.

* Update src/data/roadmaps/datastructures-and-algorithms/content/106-search-algorithms/index.md

---------

Co-authored-by: Kamran Ahmed <kamranahmed.se@gmail.com>

src/data/roadmaps/datastructures-and-algorithms/content/106-search-algorithms/index.md

@@ -1,3 +1,3 @@
 # Search Algorithms
 
-Search algorithms are techniques used for finding a specific item or group of items among a collection of data. They operate by checking each element in the dataset in order to locate the target selection. The primary types of search algorithms are linear search, binary search, depth-first search, and breadth-first search. Linear search scans each element in sequence, while binary search operates by splitting the dataset in half repeatedly until finding the desired element. Depth-first and breadth-first searches are both used with more intricate data structures like trees and graphs. The former explores the depth of a branch before the breadth, while the latter explores all neighboring nodes before proceeding to the nodes at the next level depth.
+Search algorithms are techniques used for finding a specific item or group of items among a collection of data. The primary types of search algorithms are linear search, binary search, depth-first search, and breadth-first search. Linear and binary search are explained in this section. The other two types in a next section of this roadmap.