Bifalgorithm post

Algorithms in 60 seconds, let's go. Binary search. You have a sorted array and a number you're searching for. First, you go to the middle of the array to see if the number is greater or smaller. Then search that half for the number. Repeat this process of checking the middle number and reducing the amount you have to search until you find or don't find your number.

Algorithms in 60 seconds, let's go. Binary search. You have a sorted array and a number you're searching for. First, you go to the middle of the array to see i…

Ideas in this flowchart

  • Binary Search Algorithm
  • Initial Setup
  • Sorted Array
  • Target Number
  • Search Process
  • Check Middle Element
  • Compare with Target
  • Target Found
  • Target Not Found
  • Adjust Search Range
  • Repeat Process
Bifalgorithm
Sign up
Feed/

Algorithms in 60 seconds, let's go. Binary search. You have a sorted array and a number you're searching for. First, you go to the middle of the array to see if the number is greater or smaller. Then search that half for the number. Repeat this process of checking the middle number and reducing the amount you have to search until you find or don't find your number.

C
Claire Kelly
9w

"Algorithms in 60 seconds, let's go. Binary search."

👍
0
0 comments0 shares

Sign in to view and post comments.