Pinned Repositories
PUBG-Stat-Tracker
Team: Cordell Hurst, Shani Saar, Liudmila Zyrianova Utilizing Node.js, Express, React, PostgreSQL hosted on herorku Project Proposals game stats utilizing PUBG API Display top 10 player stats in a browser. Users can drill down stats data pulled from PUBG servers stored in our database.
135-Project-1A
String and File Operations
335-Project-2-AVL-Trees
AVL Tree implementation
395Resilent
Building a secure cloud network environment to illude an attacker into a false sense of success
academics
Algorithmic Exercise
AndroidGitTest
Testing out Android Studio git features
avl_bst_compare
Java-Final-Project
Demonstrates use of lambdas and streams
swoosh
Street basketball teammate/game/league finder app for android in Kotlin
WorldPopulationSort
Lab8. This program is tasked to read an input file, parse its lines, create a struct called 'Country' for each line and places that struct into the array of a meta struct called 'World'. As each line of data is read, its first 5 fields are real numbers and the first 4 of those are used to create new numbers that are averages of every pair in the order of intake for a total of 9 numerical data elements. Those elements are placed in an unordered array called 'Pops' of a 'Country' struct. The second and last number are used to find a growth rate and the result is assigned to 'growth_rate'. The final data element from the line is taken as a string and assigned to 'name' element within the 'Country' struct. This struct is placed in an array called 'Countries' in the 'World' struct. A count of the number of 'Country' elements placed is kept as 'num_countries' as well as the 'Country' with the fastest growth rate (fastest_growth), the slowest growth rate (slowest_growth) and the quantity of negative growth rate countries (num_slowest). The countries with negative growth rates are additionally placed into an array called 'NegativeRates' within the 'World' struct. This array is sorted using insertion sort for a cost of O(N^2) Country with fastest rate of growth is printed out as well as that with the slowest. Finally, all negative growth countries are printed in order of 2015 population.
theartfuldodger1's Repositories
theartfuldodger1/AndroidGitTest
Testing out Android Studio git features
theartfuldodger1/con2
theartfuldodger1/merge-conflicts
theartfuldodger1/mergeCon
theartfuldodger1/kotlin-repo-tut
theartfuldodger1/sequelize-reference
theartfuldodger1/Mashups
Creating with Web APIs
theartfuldodger1/Java-Final-Project
Demonstrates use of lambdas and streams
theartfuldodger1/135-Project-1A
String and File Operations
theartfuldodger1/WorldPopulationSort
Lab8. This program is tasked to read an input file, parse its lines, create a struct called 'Country' for each line and places that struct into the array of a meta struct called 'World'. As each line of data is read, its first 5 fields are real numbers and the first 4 of those are used to create new numbers that are averages of every pair in the order of intake for a total of 9 numerical data elements. Those elements are placed in an unordered array called 'Pops' of a 'Country' struct. The second and last number are used to find a growth rate and the result is assigned to 'growth_rate'. The final data element from the line is taken as a string and assigned to 'name' element within the 'Country' struct. This struct is placed in an array called 'Countries' in the 'World' struct. A count of the number of 'Country' elements placed is kept as 'num_countries' as well as the 'Country' with the fastest growth rate (fastest_growth), the slowest growth rate (slowest_growth) and the quantity of negative growth rate countries (num_slowest). The countries with negative growth rates are additionally placed into an array called 'NegativeRates' within the 'World' struct. This array is sorted using insertion sort for a cost of O(N^2) Country with fastest rate of growth is printed out as well as that with the slowest. Finally, all negative growth countries are printed in order of 2015 population.
theartfuldodger1/Polynomial
Polynomials in a <list> and organized in a vector. Addition and multiplication of polynomials
theartfuldodger1/academics
Algorithmic Exercise