Binary search is an algorithm used to find the position of a target value within a sorted array. It runs in logarithmic time and requires the array to be sorted first. There are variations of binary search, such as fractional cascading and exponential search, which can be used to solve a wider range of problems.

University of Washington

Summer 2022

This course is a continuation of CSE 142, focusing on manipulating data, implementing data structures, and learning about algorithms in Java. It delves into abstract data types, recursion, inheritance, and more.

No concepts data

+ 34 more concepts