|
|
|
|
|
|
by Joof
3639 days ago
|
|
|
1. Freshman year there was a data structures and algorithms course. These remained important through my university career. You sound unlucky, so here's what you do: implement each one you are unfamiliar with in your favorite language and analyze the complexity of them. Start with linked list algorithms, then stacks/queues, then maybe heapsort and trees then implement Dijkstra's graph algorithm and BFS / DFS. |
|
|