A-Level Computer Science – Searching Algorithms Explained (Linear, Binary & Tree) (OCR / AQA) | S12:Ep2

<p>This episode introduces various <strong>searching algorithms</strong> crucial in computer science for finding specific items within data structures. It begins by outlining <strong>linear search</strong>, which involves sequentially checking each item until a match is found, and analyzes its <strong>time complexity</strong> as O(n). The text then moves to <strong>binary search</strong>, a more efficient method for <strong>sorted lists</strong> that works by repeatedly halving the search space, resulting in a <strong>time complexity</strong> of O(log n). Finally, the document briefly describes <strong>binary tree search algorithms</strong>, highlighting their use in quickly navigating data stored in a tree structure and discussing the impact of <strong>unbalanced trees</strong> on search time.</p>