Search a title or topic

Over 20 million podcasts, powered by 

Player FM logo
Artwork

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://podcastplayer.com/legal.
Player FM - Podcast App
Go offline with the Player FM app!

Efficient Top K Algorithm in C# Using Built-In PriorityQueue

9:01
 
Share
 

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://podcastplayer.com/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

Artwork
iconShare
 
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://podcastplayer.com/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

×
 
Loading …

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.

 

Copyright 2025 | Privacy Policy | Terms of Service | | Copyright
Listen to this show while you explore
Play