Build software better, together

An algorithm that implements intelligence based on a Method pool (a collection containing multiple types of functions). 一种基于方法池（包含多种类型的函数的集合）实现智能的算法

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

My Solutions to basic Algorithms and Data Structures

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.

Actively solving LeetCode problems to enhance algorithmic skills and DSA knowledge. Consistently improving problem-solving abilities and preparing for competitive programming and technical interviews.

Rock, Paper, Scissors is a simple game where two players choose one of three options: rock, paper, or scissors. The rules are: rock beats scissors, scissors beats paper, paper beats rock. If both choose the same option, it's a tie.

CSC402: Analysis of Algorithms [AOA] & CSL401: Analysis of Algorithms Lab [AOA Lab] | SE Semester IV | Computer Engineering

Gebze Technical University - Computer Engineering Assignments

Breadth First Search & Depth First Search graph algorithms

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

Comprehensive 2023-2024 study material for Algorithms & Complexity, including lecture notes, graph algorithms, shortest paths, minimum spanning trees, dynamic programming, greedy algorithms, NP problems, and exercises. Organized by chapters with supplementary PDFs and personal notes (Algorithms and Complexity, UNIWA).

Algorithm Design Solved Exercises

SmartChess is a Bluetooth enabled, smart Chessboard. SmartChess utilizes an integrated circuit to recognize where there are pieces on the board. That information is sent to the accompanying app, which provides the user with a live view of the board. The app can give hints, recommend moves, and enforces legal moves.

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

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

Easy data compression algorithm.

Comprehensive 2023 study material for Design & Analysis of Algorithms (Σχεδίαση & Ανάλυση Αλγορίθμων) including lecture notes, exercises, recursion, divide & conquer, sorting algorithms, and complexity analysis. Organized by chapters with supplementary PDFs and personal notes (Algorithm Design & Analysis, UNIWA).

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

implementation of algorithm design

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