GitHub - morton-t/CS3353-Data-Structures-and-Algorithms-Coursework: Contains code from assignments in my Data Structures and Algorithms course. Coursework explored numerous sorting algos, algorithmic analysis, greedy algos, recursion, and dynamic programming. Data structures covered in our course include: arrays, stacks, queues, linked lists, min/max priority heaps, binary trees, B-trees, and an intro to graphs

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
Homework01-Morton.Thomas		Homework01-Morton.Thomas
Homework02-Morton.Thomas		Homework02-Morton.Thomas
Homework03-Morton.Thomas		Homework03-Morton.Thomas
Homework04-Morton.Thomas		Homework04-Morton.Thomas

About

Contains code from assignments in my Data Structures and Algorithms course. Coursework explored numerous sorting algos, algorithmic analysis, greedy algos, recursion, and dynamic programming. Data structures covered in our course include: arrays, stacks, queues, linked lists, min/max priority heaps, binary trees, B-trees, and an intro to graphs

algorithmic-analysis algorithms data-structures dynamic-programming greedy-algorithms