| Electronics > Beginners |
| Data Structure and Algorithms |
| << < (5/5) |
| 0culus:
--- Quote from: coppice on June 03, 2019, 03:41:19 pm --- --- Quote from: brucehoult on June 02, 2019, 11:56:56 pm ---My personal bugbear is people still tediously learning (and coding!) AVL and RedBlack trees! --- End quote --- While these algorithms in their bare forms are a lot less useful than they used to be, I think they are an excellent starting point to get the student thinking about the nature of the problems these algorithms address. I don't think you can leap to memory aware algorithms without covering these basics. --- End quote --- Yeah, the point of covering this in an undergrad course is to build mathematical maturity around a lot of things that boil down to discrete mathematics and writing suitable proofs of correctness and grokking how big-Oh (and related notations) work. It's a building block. A hard one, but necessary. It was the weed out course in my CS curriculum. |
| Nominal Animal:
Funny aside: When debugging trees and graphs, the printf() debugging method with output in Graphviz DOT language is a superior, indispensable tool; even though "printf debugging" is usually a derisive term, like "three star programming" in C. If you haven't used Graphviz when debugging/analysing misconstructed trees or graphs, you've probably done it the unnecessarily complex and hard way. |
| Navigation |
| Message Index |
| Previous page |