andysanr's repositories
ArrayAvgMinMax
This program generates an array of 10 random integers between 0 and 100, calculates the average, minimum and maximum value of the array, and displays the original array, the average, minimum, and maximum values.
ArrayPractice
Program that includes constructors and methods to add/remove and print numbers to and from an array without importing any Java classes.
BandMatrix
Takes two integer command-line arguments n and width and prints an n-by-n pattern, with a zero (0) for each element whose distance from the main diagonal is strictly more than width, and an asterisk (*) for each entry that is not, and two spaces between each 0 or *.
BeatTheHouse
Blackjack based game designed to teach you perfect basic strategy.
BubbleSort
This program provides implementations of bubble sort data structure and random array filling for use in other Java programs.
CalendarFromToCountInC
Simple Windows Form App calendar using C# that based on the start date + count days = end date.
Fib50
The program uses a recursive function to calculate and print the Fibonacci sequence up to a certain number (50 in this case). The Fibonacci sequence is a series of numbers where each number is the sum of the previous two numbers. The program prints out the sequence by calling the recursive function with each number in the sequence.
GeneralizedHarmonic
Takes two integer command-line arguments n and r and uses a for loop to compute the nth generalized harmonic number of order r
GPAOverlay
Chrome Extension to overlay estimated GPA for every course by professor in the FIU course catalog.
GreatCircle
Takes four double command-line arguments x1, y1, x2, and y2, the latitude and longitude (in degrees) of two points on the surface of the earth—and prints the great-circle distance (in kilometers) between them. Uses the Haversine formula.
HandleCheckerProject
Checks availability of social media handles of 6 social medias via web-scraping and http status responses.
Insertion-sort
This program implements insertion sort and selection sort algorithms to sort an integer array. The main method initializes an array with unsorted values and calls the insertion sort algorithm. The sorted array is then printed to the console.
LinkedList
The program creates a linked list data structure that stores a random sequence of integers. It implements several methods to manipulate the list, including adding, removing, and searching for elements. The use of a linked list data structure allows for efficient insertion and removal of elements, as well as dynamic resizing of the list as needed.
MinValofArrayTime
This program generates an array of 10 million random integers and finds the minimum value in the array. It then prints the minimum value and the time taken to find it using the minimum() function. The program uses an array data structure to store the random integers.
QueueDataStructure
This program creates a queue data structure that holds characters. The main method tests the queue by inserting random characters into the queue, displaying the front of the queue, and removing elements from the queue. The queue is implemented using an array, and the program prevents the user from inserting more elements once the queue is full.
RandomWalker
Takes an integer command-line argument r and simulates the motion of a random walk until the random walker is at Manhattan distance r from the starting point. Prints the coordinates at each step of the walk (including the starting and ending points), treating the starting point as (0, 0). Also, prints the total number of steps taken.
RandomWalkers
Takes two integer command-line arguments r and trials. In each of trials independent experiments, the program simulates a random walk until the random walker is at Manhattan distance r from the starting point. Prints the average number of steps.
RightTriangle
Program RightTriangle takes three int command-line arguments and determines whether they constitute the side lengths of some right triangle.
StackDataStructure
The program creates a stack data structure using the Stack class and inserts random characters using the push() method. It then removes and displays the items at the top of the stack using the pop() and peek() methods. The push() method has been modified to increase the size of the stack when it is full.