An introduction to the heap data structure and .NET's priority queue

andrewlock.net

An introduction to the heap data structure and .NET's priority queue

andrewlock.net

canpolat@programming.dev to

.NET@programming.devEnglish · 8 months ago

In this post I provide an introduction to the heap data structure, describe why it's useful, and show how it's used in .NET's PriorityQueue type.

You must log in or register to comment.

Chat

.NET@programming.dev

dotnet@programming.dev

Create a post

You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !dotnet@programming.dev

Getting started

Useful resources

IDEs and code editors

Visual Studio (Windows/Mac)
Rider (Windows/Mac/Linux)
Visual Studio Code (Windows/Mac/Linux)

Tools

Decompilers: ILSpy, dotPeek
Scratchpad: LINQPad
Online playground and IL viewer: SharpLab

Rules

Rule 1: Follow Lemmy rules
Rule 2: Be excellent to each other, no hostility towards users for any reason
Rule 3: No spam of tools/companies/advertisements

Related communities

Wikipedia pages

.NET (open source & cross platform)
.NET Framework (proprietary & Windows-only)

Visibility: Public

This community can be federated to other instances and be posted/commented in by their users.

1 user / day
6 users / week
99 users / month
311 users / 6 months
2 local subscribers
1.46K subscribers
288 Posts
215 Comments
Modlog