How to Implement Binary Search In Data Structure #PW #Shorts

Añadido: 2026-05-16

[00:00:00]And let's say not to find the middle element, but to find any other element, what would be the best case complexity and the worst case complexity on a sorted linked list? In linked list, whether it's sorted or not sorted, uh the complexity would be order of n.

[00:00:16]Okay, why so?

[00:00:18]Uh because there are one algorithm called binary search, which takes order of log n. But to implement binary search, we need somewhat of random access in in the in the particular data structure, but linked list can't provide us the random access. So, if even if we implement the binary search somehow in linked list, it would still take order of n.