In this card, we are going to help you understand the general concept of Binary Search. Binary Search is one of the most fundamental and useful algorithms in Computer Science. It describes the process of searching for a specific value in an ordered collection. Terminology used in Binary Search: (1) Target - the value that you are searching for (2) Index - the current location that you are searching (3) Left, Right - the indicies from which we use to maintain our search Space (4) Mid - the index that we use to apply a condition to determine if we should search left or right
Stanford Engineering Everywhere (SEE) expands the Stanford experience to students and educators online and at no charge. A computer and an Internet connection are all you need. The SEE course portfolio includes one of Stanford's most popular sequences: the three-course Introduction to Computer Science, taken by the majority of Stanford’s undergraduates, as well as more advanced courses in artificial intelligence and electrical engineering.
