apparently d-ary trees have more efficient priority-update operations, but slower delete-max operations. since I'll never be doing the latter maybe I could use this :thounking:

@SuricrasiaOnline How big do you expect N to be? Considering Weird Cache Things sometimes making the simple but technically suboptimal things faster

@elomatreb N would likely range somewhere between 10 to 100, maybe 1000? idk yet but no more than 1000

@SuricrasiaOnline I'd definitely try benchmarking a "simple" version with just a sorted array compared to something more complex, I was recently extremely impressed by how slow pointer-chasing trees can be
Sign in to participate in the conversation

Cybrespace is an instance of Mastodon, a social network based on open web protocols and free, open-source software. It is decentralized like e-mail.