Closest pair of points in 2D, not using O(N^2) in C++

Hello! I'm an expert in algorithms and very proficient in C++. I would love to know specifics about your project in chat.

Hii, I am a 4-star coder on CodeChef, and I have solved over 600 problems on leetcode, gfg, code forces, CodeChef. Please share more details about this project. I have a good knowledge of C++ programming, and maybe I can help you with this project waiting for your text.

Hello. I'm algorithm master. I can realize your project in ***O(n * log(n))*** using KD-tree algorithm using C++. Immediately.

Hi, ⭐I'm an expert you are looking for⭐ Thank you for posting this project. ✅ Having reviewed your job description for a while, it looks like a perfect fit for my skill set. ✅ which softwere in Expertises? » C#, ASP » PHP & Laravel & Symfony » React Native » React.js with Redux (MVVM) » Angular.js (MVC) » Vue.js » .NET (.CORE, .MVC, API ) » Node.js (MVC) » Nestjs » SQL » Mongo (NoSQL) » Paypal & Stripe API Integration » Google Map API, Vector tiles -using Github -Amaon experience This is why I'm here as your expert. Please contact me. Thank you for reading my proposal.

Please share more details about this project I have a good knowledge in C++ programming maybe I can help you in this project waiting for your text have a nice day it all will be in your budget SANSKAR

Hi. Dear. Hope you are doing well. I have read your job description and understood enough. I am a C/C++,C#, ASP.Net programmer with rich experience of more than 8 years. I have been working with worldwide excellent clients and delivering them perfect results, so, I have been keeping long-term relationship with them. I can work at client's timezone flexibly for exchanging opinion. Please hire me to get full satisfaction without wasting time and losing much money. I shall deliver only perfect results to keep the long-term relationship. I am waiting forward to your message. Thank you for your time. Regards.

I can easily solve. I also coding youtube Channel "ThinkCode" where i solve leetcode contest problems, daily leetcode challenges. I solve in C++. Feel Free to connect. You can get my details from my channel as well.

i have strong algorithm design and analysis skills, strong grip on data structure usage in problem solving. please let me know the details i will surely have the solution in O(nlgn) or less.

Hi Ranchi. Using graph optimization, complicity can reduce much. i.e O(3n). I have experienced this problem solve. Happy to discuss how my previous project aligns with yours. If you award me the project, I’d be pleased to discuss this further and get started for you as soon as possible. Thanks Zovonko.

Expert in C++ Hello I read project description carefully, and understood your requirement. I know algorithm, which can find nearest 2D point in O(nlog) time. Kindly text me in the chat with project details, so we can discuss further on it. Thanks.

I am good at C/C++ programming, Math, Algorithms basics, I will do it insha'Allah. please, Contact me with the details.

Hi, I have good experience in C/C++ programing. I feel I can complete this in one day. Ping me for more information.

Hey I can do this easily. I have solved similar problems before and I already have the O(nlogn) solution in my mind. I will be glad if you discuss the full problem in the chat so that I can help you and may be optimize it further. Thank You