Algorithms Made Easy Tutorial 6 - Interpolation Search

Also follow me on social media :D

Steam ID: CodingMadeEasy

Feel free to download my apps as well!

Driving Frenzy
----------------------------

[NitinTiwari]

Thanks for going deeper in to algo, I was looking for something like that

[ratshitpartners]

instead of keep resetting the min and max each access (binary tree) this one gets the value range, and guesses the approximate position inside, and ur getting gains out of it? thats pretty cool. didnt think of this. one thing id like to point out, is the "value" is never higher than the high bar, its always looking below it, to be inside the range. (so x, is always an under interpolation, it never looks past the high bar, always before it.)

[BLProHD]

Thanks! Keep making these! I love all of your tutorials!

[coffle]

Clear and easy to understand, thanks man!

[EktaNandwani]

What does "uniformly distributed array" mean?

[sharonalexander]

osm!! Thank you very much :D
I think line number 145(17:42) should be
while(tempArray[high]>=value && tempArray[low]<=value)
an extra "=" is added at the tempArray[low]<=value

[PomegranateAmazing]

very helpful video for a very rare algorithm. thanks a lot
but you should also include cases where slope is decreasing and increasing. i meant convex and concave type graphs. it would explain the necessity of iterations.

[KiranKumarAVK]

Very nice tutorial. Thank you very much :-)

[subhascse]

I have a question. You are comparing "value" with "tempArray[index]". After first two checks (greater / less than), only one case can happen where "value == tempArray[index]". Why don't you return "true" at that moment itself?

[datastructure]

Sir please tell me about software you are working in this tutorial(Request)