Pinned Repositories
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.
Calculator
Concepts Calculator
CS3800_project
jordantbui's Repositories
jordantbui/Final-Project---CS-3310
jordantbui/FreeNos-CS4310-Project
jordantbui/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.
jordantbui/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
jordantbui/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.
jordantbui/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)
jordantbui/Project-7-Race-Conditions
jordantbui/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.