Some fun with data structures and algorithms!
Standard output of each of the projects is shown below.
DFS_BFS output:
Graph: {A=[U], B=[C], C=[M], D=[S, D], E=[A, O, L, S], F=[A], G=[K], H=[R, R], I=[E], J=[C], K=[O], L=[C], M=[I], N=[R], O=[A, P, F, K], P=[N], Q=[N], R=[H, L], S=[], T=[O, E], U=[G, C], V=[I], W=[F], X=[A], Y=[I], Z=[Z]}
BFS path: [A, U, G, K, O, F]
DFS is path found: true
linked_list output:
Linked list: Node [node=A, next=Node [node=B, next=Node [node=C, next=Node [node=D, next=Node [node=E, next=null]]]]]
Reversed: Node [node=E, next=Node [node=D, next=Node [node=C, next=Node [node=B, next=Node [node=A, next=null]]]]]
list_products output:
X: [1, 2, 3, 4, 5, 6, 7, 8, 9]
belowXi: [1, 1, 2, 6, 24, 120, 720, 5040, 40320]
aboveXi: [1, 9, 72, 504, 3024, 15120, 60480, 181440, 362880]
products: [362880, 181440, 120960, 90720, 72576, 60480, 51840, 45360, 40320]
sorts output:
Time comparison to sort 1,000,000 elements:
QuickSort duration: 2.412000
MergeSort duration: 0.939000
HeapSort duration: 1.390000
tree_generator output:
Preorder:
A
B
C
D
E
F
Inorder:
C
B
D
A
F
E