jordantbui Goto Github PK

final-project---cs-3310

freenos-cs4310-project

hw-4-cs-2640

MIPS Program: Creates a search function that searches a given array of bytes for a given value and returns its location in the array.

midterm-project-1-cs-3310

Comb Sort Algorithm - sorts an array of randomly generated numbers using Comb Sort and displays run time for each different array size

midterm-project-2-cs-3310

Sum Finder Program - finds 2 numbers from an array of numbers that add up to a randomly generated sum, using the Brute Force method and the Hash Map method, both for sorted and unsorted randomly generated arrays.

midterm-project-3-cs-3310

Chained Matrix Multiplication using Yao Solution (1982) - performs matrix multiplication using a more efficient method at Time Complexity: O(n^2)

project-7-race-conditions

quiz-4-cs-3310

Peaks and Valleys sorts array elements in an alternating sequence of peaks and valleys, where peaks are elements that are greater than or equal to the adjacent integers and valleys are elements that are less than or equal to the adjacent integers. Build order builds an array of projects in a specific order, based on given project dependencies.