Hacker News Reader

Ciberthon Show HN: Krucible – Kubernetes clusters for testing and development

Thanks to both, right now we are having a hard time and lot of work with exams and end of semester but I will look into this in the summer months for next year. It would be really cool to give them a sneak peek ;) Thanks again!

Ciberthon Show HN: Krucible – Kubernetes clusters for testing and development

How well is this suited to use in classes? We are searching for a good way to learn students cloud stuff (asw/azure/... but also kubernetes) without high $$$

Ciberthon You're doing it wrong: B-heap 10x faster than binary heap (2010)

Out of pure curiousity: "... That is where it all went pear-shaped: that model is totally bogus today. ..." I agree that most concepts about operating systems are dated but where are the good resources that give an overview without being overwhelming?

Ciberthon Regex for Noobs – An Illustrated Guide

By any chance studied in Belgium, Ghent? Just curious for educational purpose :)

Ciberthon Simple Trie Implementation in C++11

Ohn it would have been cool to have a look. I have some start questions and code from a few years back at uni but I really disliked the courses, prof and way of programming. If you would be interested I can share them to gain some insights or motivations on how to (maybe not) do it :)

Ciberthon Simple Trie Implementation in C++11

I don't like auto over int, and other primitives. But auto in for loops or with iterators seems the way to go and is a bless!

Ciberthon Simple Trie Implementation in C++11

I really love this! I saw your github repo "forest" as well. I wish there were more bundled resources or code examples like this. Not because I think everything should be out there in the open, free to get. But more as a way of retrieving examples about (maybe complex) algorithms.

Traditional books fail me in most of the cases as I want modern techniques combined with (maybe) "old" algorithms.

I would love it if people could show me modern examples and implementations (and reasoning) about let's say things from clrs for example:

- trees (red/black, splay, B, quadtrees, k-trees

- dynamic programming

- hasing (extendible, linear)

- pairing heaps, binomial queues

- shortest distances with dijkstra, johnson, bellman-ford

- finite state machines etc

- string algorithms like boyer-moore, knuth-morris-pratt

- (...)

FYI: I had no account prior to this comment, created one just for you ;) Keep up the good work OP!