DanielMevs's repositories
Babylonian-Algorithm
A program that computes the square root of a given x using the Babylonian Algorithm
Binomial-Coefficients-and-Pascals-Triangle-Properties-in-Python
Contains various proofs and properties about Pascal's triangle
Cantor-Set-in-Python
Cantor Set generator in python
Combinations-Vs.-Permutations-in-Java
This example illustrates the difference between combinations and permutations using the problem, "How many ways are there to arrange a hand of 5 cards out of a standard 52 card deck?"
Dates-and-Time-in-Python
This repository explores ways of working with times and dates in Python.
Fizz-Buzz-in-Java
My take on Fizz Buzz.
Fizz-Buzz-in-React
Install node. Then do an npm install. And then npm start
Font-Size-App
An app to increase or decrease the font size of a paragraph with buttons
Fun-With-Matrices-in-Python
A repository dedicated to showcasing applications of Matrix Theory computed in Python
HTML-Parsing-Files-OS-and-more-in-Python
The following code examples are from a Python course sponsored by LinkedIn. Course can be found at: https://www.linkedin.com/learning/learning-python/learning-python
Insertion-Sort
Python and C++ Insertion Sort implementation with a compexity of O(n^(2))
Jenkinsfile-Practice
This repo is dedicated to connecting jenkins to github.
Leader-Election-in-Python
Leader election: The process by which nodes in a cluster (for instance, servers in a set of servers) elect a so-called "leader" amongst them, responsible for the primary operations of the service that these nodes support. When correctly implemented, leader election guarantees that all nodes in the cluster know which one is the leader at any given time and can elect a new leader if the leader dies for whatever reason.
machine-learning-with-python-logistic-regression-3211129
This is a LinkedIn Learning repo for Machine Learning with Python: Logistic Regeression.
Messaging-App-Using-Sockets
This example demonstrates polling and streaming in action. If in polling mode, the client will make a request at a set interval to the server, and receive the response accordingly. A socket is a file that lives on your computer that your computer can write to and read from to communicate with another computer. A server will push data through this open, long-lived connection with the socket, creating an instant, 'live' experience. This process is known as streaming and can remedy the server-load created by polling, especially at large scale (use-case should be considered).
practice-it-python-data-structs-2486182
Practice It: Python Data Structures
Quick-Heap-and-Insertion-Sort-Runtime-Comparison-in-CPP
Analyzes the runtime of quicksort(the fastest with best case complexity O(nlogn)), heapsort(the second fastest with worst case complexity nlogn) and insertion sort(BY FAR the slowest with best case O(n) worst case O(n^2) complexity. Runtime.cpp is the source for data analsis. Python files included
Quick-Sort
Quick Sort algorithm implemented recursively with C++ and Python (although with different approaches). Quick sort has a runtime complexity of O(n^(2)) and best case O(nlogn)
Remove-Character-Duplicates-in-String
My remove character duplicates in a String with linked lists.
Riemann-Sum
Calculates the right left and midpoint rieman sums given an interval, size of subinterval, and function
Stochastic-Models
repo dedicated to exercises in my stochastic models class