Let See How the Binary Search is Working

[{"selector":"#anim-829a610f-1e9c-4e61-9c15-9745ba6e0d4c","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-a68ead61-7879-477a-8b02-8d8276ccabea","keyframes":{"transform":["translate3d(-114.6875%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-23942fa1-96bf-417c-9fdc-107d35b9b246","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-4422042f-0402-49ee-9fb1-7ca2c9002d2c","keyframes":{"transform":["translate3d(0px, 104.13348%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Learn more

First Condition is ,array should be soted

[{"selector":"#anim-57ef92ad-55b7-4de4-912d-d50f3a77f76c","keyframes":{"transform":["scale(1)","scale(1.5)","scale(0.95)","scale(1)"],"offset":[0,0.33,0.66,1]},"delay":0,"duration":1450,"easing":"ease-in-out","fill":"both","iterations":1}] [{"selector":"#anim-d3418f8e-437c-442c-b7bf-fc156e09d141","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-256d598d-4018-4f7e-ba87-700209a7af0d","keyframes":{"transform":["translate3d(0px, 104.13348%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Find length of array ,here it is 5 and mid 2 at index 2 = 3

we have to find key = 2 element in array

but the middle element is greater than key so

we have to find the key in left side of middle element

so , we will consider ,search in left side and again start

find mid and check mid==key if yes we find it !

at index 1 key==arr[1] we find key done ! algo

if You want c++ | Java | Python | Implementation read full article below..