Interpolation Search algorithm (with Example & CODE)

This video explains the interpolation search algorithm with example and CODE which is posted in the link below. This lecture compares interpolation search with binary search and shows when interpolation search works better than binary search. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[chimeremanaege]

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

[rahulchaubey]

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

[voytko]

Thanks, bro! Greatest explanation Ive ever heard!

[krupapatel]

Very nice video and explanation thank you so much

[RohitKumar-mywf]

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

[connorwilliams]

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

[soulvocals]

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

[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.

[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?

[jonayethossain]

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

[gtxmax-q]

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

[udayanbandyopadhyay]

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

[the_ghost_of_uchiha]

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<=(x)<log(n)??

[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

[sudiptaghosh]

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

[yegi]

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

[hritwiksom]

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?

[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?

[Tarunkumar_Gatla]

Bhai algorithm dry run Mai bhi Kar lunga🤦
Explain the intuition behind the algorithm

[girrajjangid]

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