Thanks for visiting The Cell Phone Junkie! I will be taking the time each week to discuss my favorite topic, cell phones. Any feedback is appreciated and welcome. You can email me at: questions (AT) thecellphonejunkie (DOT) com or call: 206-203-3734 Thanks and welcome!
…
continue reading
Content provided by Andrea Angella - Senior Software Engineering Manager, former Microsoft C# MVP, Andrea Angella - Senior Software Engineering Manager, and Former Microsoft C# MVP. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Andrea Angella - Senior Software Engineering Manager, former Microsoft C# MVP, Andrea Angella - Senior Software Engineering Manager, and Former Microsoft C# MVP or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
Player FM - Podcast App
Go offline with the Player FM app!
Go offline with the Player FM app!
Efficient Top K Algorithm in C# Using Built-In PriorityQueue
MP3•Episode home
Manage episode 498205964 series 2560973
Content provided by Andrea Angella - Senior Software Engineering Manager, former Microsoft C# MVP, Andrea Angella - Senior Software Engineering Manager, and Former Microsoft C# MVP. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Andrea Angella - Senior Software Engineering Manager, former Microsoft C# MVP, Andrea Angella - Senior Software Engineering Manager, and Former Microsoft C# MVP or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
🚀 Boost your .NET skills with this efficient algorithm tip! Want to find the Top K elements from a large dataset without sorting the entire thing?Let me show you how to use the built-in PriorityQueue in .NET to get it done with just O(N log K) complexity 💡It’s a simple but powerful trick: ✅ Use a MinHeap of size K ✅ Keep only the top K elements seen so far ✅ Achieve blazing-fast performance thanks to O(1) min peek📺 I walk through the full solution (with modern C# code)If you found this helpful: 🔁 Share with your fellow devs 👥 Subscribe for more practical .NET tips and software engineering content!
…
continue reading
52 episodes
MP3•Episode home
Manage episode 498205964 series 2560973
Content provided by Andrea Angella - Senior Software Engineering Manager, former Microsoft C# MVP, Andrea Angella - Senior Software Engineering Manager, and Former Microsoft C# MVP. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Andrea Angella - Senior Software Engineering Manager, former Microsoft C# MVP, Andrea Angella - Senior Software Engineering Manager, and Former Microsoft C# MVP or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
🚀 Boost your .NET skills with this efficient algorithm tip! Want to find the Top K elements from a large dataset without sorting the entire thing?Let me show you how to use the built-in PriorityQueue in .NET to get it done with just O(N log K) complexity 💡It’s a simple but powerful trick: ✅ Use a MinHeap of size K ✅ Keep only the top K elements seen so far ✅ Achieve blazing-fast performance thanks to O(1) min peek📺 I walk through the full solution (with modern C# code)If you found this helpful: 🔁 Share with your fellow devs 👥 Subscribe for more practical .NET tips and software engineering content!
…
continue reading
52 episodes
All episodes
×Welcome to Player FM!
Player FM is scanning the web for high-quality podcasts for you to enjoy right now. It's the best podcast app and works on Android, iPhone, and the web. Signup to sync subscriptions across devices.