algorithm

Binary Search Explained in Detail with Three Templates

by

In its simplest form, binary search works on a contiguous sequence with specified left and right indices, also known as the search space. It continuously narrows down the search range to eventually locate the target value or determine that it does not exist. Basic Concept Binary search maintains three pointers: left, right, and mid At … Read more

algorithm analysis

by

Time complexity is a way to describe how the running time of an algorithm changes relative to the size of its input. In other words, it answers the question: “If I make the input bigger, how much longer will this algorithm take to run?” Key Points: Input size is usually denoted as n. Time complexity … Read more