My Solutions to basic Algorithms and Data Structures

Breadth First Search & Depth First Search graph algorithms

Some collection of codes that are used in data mining and data science related fields, developed by me

This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.

Gebze Technical University - Computer Engineering Assignments

Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)

Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph

🗺️ Proposed solution for the Multi-Depot Vehicle Routing Problem with time constraints

This repository contains an advanced Ant Colony Simulation that demonstrates emergent behavior through pheromone-based pathfinding and collective food gathering.

Python number guessing game: Computer picks a random number, user tries to guess it. Computer gives hints (too high/low). Repeat until correct. Add difficulty levels, limited tries, or scoring for more challenge.

Maximum sum subarray problem using brute force, divide & conquer and dynamic programming

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover

Repository for the code of a Chess Engine connected to XBoard

Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.

collection of beginner-friendly programming projects

📐 A desktop application practice and powered by JavaFx. (Curriculum design for algorithm)

A list of projects I've worked on. GitHub's organization is lacking in my opinion, so this serves as an index & root of all my work (I'm Noah Patullo, not Pattullo or Patulo. I have a unique name & this should help clarify who I am)

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

Tutorials given as one of the TAs for the class "Algorithm Design and Analysis" at Nanjing University

Dr.Mosavi Design of Algorithm homeworks