Interpolation Search algorithm (with Example & CODE)

[@rahulchaubey8988]

If i find your vdo on any topic then i got sure i m going to understand this concept.

[@techdose4u]

:)

[@uubaidullah]

Bro, you described it very well .I tried to search regarding this algorithm and i was scared by the jargon but we make it real smooth,hats off.

[@techdose4u]

Thanks

[@chimeremanaege785]

Enjoyed your lecture ❤️. Thanks a lot. I will be writing my exams in 2 hours. Wish me success 🙏

[@jonayethossain7645]

This tutorial really helpful for computer science and engineering students..

[@techdose4u]

😊

[@krupapatel4623]

Very nice video and explanation thank you so much

[@RohitKumar-my6wf]

Yrr mast padhato ho yrr sb doubt clear ho jaata h❤️❤️

[@soulvocals3474]

Basically it all depends upon the formula..nice explanation..👍

[@techdose4u]

Thanks

[@connorwilliams1647]

Great delivery and explanation, but I'd love if you got some type of writing pad for future videos. Was difficult to read. Ty tho

[@techdose4u]

My handwritting is bad 😅

[@sudiptaghosh6362]

Dada Tum Bariya Kam Kar Rahe Ho !!!! ❤❤❤❤

[@techdose4u]

Dhonnobaad 😊

[@voytko1994]

Thanks, bro! Greatest explanation Ive ever heard!

[@dgomezperry]

Great video! I really liked the explanation between both algorithms! I have a question I am not sure if it will make sense but, is there a way to calculate the uniformity of a sorted array before choosing to use binary or interpolation?

[@tanveerhaiderjafri4133]

Using sum of natural number i think

[@sye9522]

use seriese and sequence..

[@nahom560]

Grazie from Italy, really well explained :)

[@techdose4u]

Glad you enjoyed it!

[@girrajjangid4681]

It will more simple. We need single formula thats it- new_idx = (target_value - A[0]) / (A[1]-A[0])

[@asaachkay]

😂 and how you came up with this revolutionary formula. By this program will go in loop 😢

[@serendipityx737]

such an easy to understand tutorial!

[@alonebuthappy33]

Got it in on one watch 😇

[@techdose4u]

Nice :)

[@rabiumuhammedeffect423]

great explanation

[@harshitgupta7111]

*nice explanation*

[@techdose4u]

Thanks

[@renzolim6868]

love your vids. explained well

[@techdose4u]

Thanks :)

[@CodeSeeker]

Sir its like an AP series so can we use the formula an=a+(n-1)d
as u said the distance between every two consecutive numbers must be equal

[@asaachkay]

Ap gives us sum of the series but here we don't want sum so, this formula is for😊

[@yashwanthchennu5544]

Awesome explanation Bro

[@jeihenberb]

What if the elements are 1,2,2,3,4,5 and i want to find the value 2 which one should it search first?

[@techdose4u]

If you apply the formula then you get index=int(5/4)=1 (because decimal value is automatically discarded for int). Therefore, you will go and check at index 1 first and hence you will get the left 2 first. I hope you got it :)

[@jeihenberb]

@@techdose4u thank you so much sir

[@techdose4u]

@@jeihenberb welcome :)

[@AmarKumar-vo2bv]

But 1 2 2 3 3 4 5 are not in AP or GP or HP then how it will get

[@aviraldev5109]

But it doesn't work for finding number of duplicates example 1 2 2 2 2 3 calculations fails at a point it produce error

[@gerardndayisenga906]

thanks so much

[@techdose4u]

Welcome :)

[@Spider-Man_67]

Superb Explanation

[@akteruzzaman9483]

Well explained

[@gtx1650max-q]

so if array uniformity is at its worst then interpolation is still good or should i use only binary search then ?

[@hritwiksom3032]

What is the worst case of IS for totally random distribution, O(n)? Like I chose 10 random numbers out of say 1000 elements, sorted them and conducted a search on them?

[@reemaalhamdan1]

interpolated search means you have information on how your data relates to one another. So you can't know how many steps it will take unless you know the pattern of your data.

[@the_ghost_of_uchiha5939]

Sir, In Binary search ,the worst case time complexity would be "log(n)", and interpolation is better than BS , then what would be its worst case time complexity? 1

[@roshnidey865]

hats off sir!v thanks a ton!

[@techdose4u]

Welcome :)

[@Yegane-j4h]

for bs you said time complexity is log n cause you assumed the list was already sorted right?

[@bibasniba1832]

Thank you!

[@techdose4u]

Welcome

[@sam.francis]

Thanks a lot.

[@techdose4u]

Welcome

[@jonayethossain7645]

Nice.

[@techdose4u]

Thanks

[@jonayethossain7645]

@@techdose4u Welcome

[@HungryBirdStephenHaokip]

if the elements were uniformly distributed... is it guaranteed that we will get the element we are searching for in just one step .. plis answer me

[@techdose4u]

It can be possible to get the element you want to search in just one step provided elements are in AP or GP or HP progression series. It should be possible to derive the pattern and hence the mathematical formula for Nth term otherwise it should not be possible to search any element in just one step (even though distribution is uniform). I hope you got your answer :)

[@pencodes3580]

any explanation of the formula

[@pein7603]

nice

[@FlexE002]

Great explanation and topic to choose , You deserve too many applause and as well appluads
#TECHDOSE

[@augustoalmeida2586]

Is this less than O(n)??

[@CompilationError]

O(1)

[@sayak]

but how we came up with the formula that's what I wanted to know

[@sayak]

nevermind found the proof in geeksforgeeks

[@techdose4u]

Can't say man 😅

[@ankitgupta8797]

@@sayak Where is it?

[@RajeshSriMuthu]

Yoou are Awesome

[@techdose4u]

Thanks :)

[@harishmd7843]

Sir pls tell me in Tamil or Telugu 😊

[@MohsinTeacH]

I found mistake in this
You put 27 instead of 25
In upper case minis 1

[@dharaniappikonda4661]

Tq

[@techdose4u]

Wc

[@kmsabbir007]

Sir please give this code in java language

[@sumeetkumarsingh9377]

His teaching is wrong while explaining the formula he says low is value at index 0 and when giving the example he says opposite of that.