-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtodos.html
31 lines (19 loc) · 965 Bytes
/
todos.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
Objectives:
<!--TODO: Understand Inner classes -->
<!--TODO: Learn limits of integers, long, float etc -->
<!--TODO: Implement ResizingArrayQueue -->
<!--TODO: Implement Binary Search Week 1-->
<!--TODO: Implement Three Stacks In Array Again (Little buggy in the book) -->
<!--TODO: Understand Iterative versions of Tree traversal -->
<!--TODO: Fix Trees problem 11 -->
<!--TODO: Implement Dijkstra's 2 Stack Algorithm Week 2-->
<!--TODO: Learn Quicksort, and Mergesort Week 3-->
<!--TODO: Analyze any recursive algorithm's stack (mergesort)-->
<!--TODO: Implement Symbol Table(Hashmap) using linked list, and ordered arrays -->
<!--TODO: Learn AVL trees in depth -->
<!--TODO: Problem 76 from book -->
<!--TODO: Algorithmic Crush and Picking Numbers problems HR">
Goals
<!--TODO: Complete Data Structures and Algorithms book-->
<!--TODO: Understand Algorithms Complexity Analysis-->
<!--TODO: Understand and code mergesort bottom up and top down-->