Thirdjhh This Hope

Church

That's right man

Checking

crypto

Cryptocurrency

artsandculture

Society, Arts & Culture

Watching

Given an array arr[] = {1, 2, 3, 5, 8, 12} and a target number k. Find the element that is just smaller than k.Simple Solution: Linearly traverse the array and find the number that is just smaller than k. Time Complexity O(n).Optimized Solution: Binary Search into the array. If the middle element of the array is equal to the target, you just return the mid.If you find the mid element bigger than the target, you just discard the mid and everything bigger than it.If you find the mid element is smaller than the target, the mid element could be an answer, you want to keep it, but discard anything

How Does The Binary Search Algorithm Works?

Given an array arr[] = {1, 2, 3, 5, 8, 12} and a target number k. Find the element that is just smaller than k. Simple Solution: Linearly traverse the array and find the number that is just smaller than k. Time Complexity O(n). Optimized Solution: Binary Search into the array. If the middle element of the array is equal to the target, you just return the mid.If you find the mid element bigger than the target, you just discard the mid and everything bigger than it.If you find the mid element is smaller than the target, the mid element could be an answer, you want to keep it, but discard anything

Second Idea

You'll learn about binary search in a cool way

Church

Gas

Watching

Mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm

Anuj Kumar Sharma