Real World
Projects
During my time at U.A.B., in the workforce, and through personal use, I have developed numerous
tools that can be practically deployed in everyday life.

- Agricultural drone – Aerial drone used to monitor crop health and ensure farmland security using sensors and imaging.
- Facial recognition program – A security system that grants access only to authorized users using face-scanning technology.
- BCBSAL App Dev SharePoint Page – Internal tool serving as a sitemap, tool finder, information directory, and employee directory.
- Website deployments – Multiple personal, academic, and professional websites deployed using modern web stacks.
- Quicksort – An efficient, divide-and-conquer sorting algorithm commonly used in performance-critical applications.
- Merge sort – A stable, recursive sorting algorithm with guaranteed O(n log n) performance.
- Timsort – A hybrid sorting algorithm (used in Python) combining merge sort and insertion sort for optimized performance.
- Bucket sort – A distribution-based sorting technique useful for uniformly distributed input.
- Shell sort – An in-place comparison sort improving on insertion sort by comparing distant elements first.
- Radix sort – A non-comparative integer sorting algorithm sorting data with integer keys by individual digits.
- Comb sort – An improvement on bubble sort that eliminates turtles (small values near the end) more efficiently.
- Insertion sort – A sorting algorithm that builds the sorted list one element at a time.
- Selection sort – A comparison-based algorithm that repeatedly finds the minimum element.
- Bubble sort – A simple but inefficient sorting algorithm, often used for educational purposes.
- Depth-first search – Graph traversal algorithm that explores as far as possible before backtracking.
- Breadth-first search – Graph traversal that explores all neighbors level by level, useful for shortest path algorithms.
- Binary search – A fast search algorithm for sorted arrays, cutting search space in half with each step.
- Linear search – A method for finding an element within a list by sequentially checking each element of the list until a match is found or the whole list has been searched.
I really enjoy building and modifying desktops in my spare time as well.