A collection of three Python projects from CS3345 at UT Dallas.
Files: Proj_1.py, ExtraCredit.txt
Implements a bottom-up splay tree with:
insert(key),delete(key),search(key)- Preorder print using
kRT/kL/kR - ExtraCredit.txt contains one-pass (top-down) splay pseudocode
Files: sorting_algos.py, benchmark.py
- Mergesort (iterative)
- Quicksort (median-of-three + cutoff = 15)
benchmark.pytests random vs. nearly-sorted arrays (sizes 1K/5K/10K) and prints timing results
Files: Maze.py, Maze_wPen.py, GUI.py
-
Maze.py- DFS maze generator
- BFS solver → direction string (e.g. “SENW”)
-
Maze_wPen.py- Dijkstra’s solver with wall-knock penalties
- ASCII output + penalty report
-
GUI.py- Tkinter GUI to draw the maze
- “Solve” button highlights path and shows directions
Make sure you have Python 3 and tkinter installed. tkinter is native to python.