Closest Pair Problem | How to identify the closest set of points? | Brute Force
Vložit
- čas přidán 14. 05. 2021
- This video cover the closest pair problem with the help of brute force approach. We will be looking at this topic in subjects like Design and analysis of algorithm, graph theory and data structures.
Here in this video I shall cover step by step working procedure of sequential search and we shall look at the algorithm for it.
Go through the content and feel free to contact me through the following mail id.
thezensloth@gmail.com
Thank you.
WOAH!!! you've made the concept too easy to understand.
Nice explanation
Upload videos related topics such as covex hull and others
Thank you so much
You have beautiful handwriting...
also how to do this for a k-dimensional space?
i and j are coordinates of a point or i and j are position of two separate points?please clarify me
D minimum - infinity
Anyone from CSE D?...
🙄🙄
No bro I’m from cse C
Nanba o nanba .... Padikkuriya nu keta , illa macha , pubg aaduren nu soltu , ears la ootha nanba .... Perumaiya irukku
Annaikku poota commend da...😂@@veshala9108
@@shrishw.n2308intha oora yemathalam.. Ulagatha yemathalam... Aana yenna yematha mudiyathu...💀
What's the language you used sir?
Sorry I cannot understand the question properly..
@@mrvtutorials5092 first of all your teaching is clear and easily understandable. I'm just asking about the name of the programing language used in algo. writing. I have seen those programing language on data mining text book.
I hope, the question is understandable
@@gokulrajann36 ok.. First things these are algorithms which could be converted into any of the programming language you want to. These are generic statements.
@@mrvtutorials5092bhai 😂, u thought he's sarcastic ryt?