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

python machine-learning reinforcement-learning deep-learning graph-algorithms neural-networks algorithm-design adaptive-algorithms path-search-algorithm computational-graph automated-feature-selection entropy-optimization path-search

• Updated Nov 8, 2026
• Python

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

algorithm tutorial algorithm-analysis problem-set nanjing-university algorithm-ta-tutorial algorithm-design

• Updated Jul 11, 2019
• TeX

数学建模全流程引导智能体：三角色一体化（布鲁姆L1-L8引导式学习、苏格拉底深度探究、P-M-A-D四阶段建模引导），只做方法论引导、不代求解不代写

skill optimization higher-education algorithm-design mathematical-modeling ai-agent socratic-method bloom-taxonomy shumo-expert

• Updated Sep 2, 2026

My Solutions to basic Algorithms and Data Structures

hashing tree linked-list stack queue graphs recursion backtracking sorting-algorithms heap dynamic-programming symbol-table searching-algorithms greedy-algorithms disjoint-sets selection-algorithms string-algorithms divide-and-conquer algorithms-and-data-structures algorithm-design

• Updated Oct 3, 2020
• Java

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.

data-validation game-development python-programming loops error-handling logic-programming conditional-statements random-number-generator algorithm-design basic-python-project user-input-handling

• Updated Jan 26, 2026
• Python

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.

game-development randomization control-flow random-number-generators logic-programming conditional-statements programming-fundamentals algorithm-design user-input-handling interactive-console-application

• Updated Aug 26, 2024
• Jupyter Notebook

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

leetcode-solutions problem-solving coding-challenges leetcode-java leetcode-python leetcode-cpp datastructures-algorithms algorithm-design compititive-programming optimization-technique

• Updated Oct 22, 2026
• Python

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

computer-science engineering algorithms data-structures computer-engineering algorithm-analysis textbooks divide-and-conquer algorithm-design data-structures-and-algorithms analysis-of-algorithms university-of-mumbai algorithm-design-and-analysis ameythakur amey megasatish reference-books ameyarc amey-thakur aoa-lab

• Updated Sep 5, 2026
• JavaScript

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

cellular-automata python3 matrix-multiplication integer-compression theoretical-computer-science algorithms-implemented algebraic-computation integer-arithmetic complexity-analysis algorithm-design complexity-measure complexity-theory advanced-algorithms diophantine matrix-multiplication-parallel complexity-algorithm divide-and-conquer-approach

• Updated Nov 23, 2022
• Python

Breadth First Search & Depth First Search graph algorithms

search algorithm stack queue algorithms graph graph-algorithms graphs dfs first bfs algorithm-analysis breadth-first-search depth-first-search breadth algorithm-design bfs-layers

• Updated May 24, 2017
• Java

Gebze Technical University - Computer Engineering Assignments

python c java linux computer-science unix cpp common-lisp assembly oop posix data-structures programming-languages discrete-mathematics system-programming algorithm-analysis logic-circuit computer-organization algorithm-design circuits-and-electronics

• Updated Jun 25, 2023
• Java

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).

algorithms graphs complexity np-complete graph-theory dynamic-programming shortest-paths lecture-notes minimum-spanning-trees greedy-algorithms dijkstra-algorithm algorithm-design bellman-ford-algorithm study-material 2024 uniwa

• Updated Feb 16, 2026

Algorithm Design Solved Exercises

algorithm-design

• Updated Aug 3, 2023
• TeX

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.

swift arduino ios design solidworks woodworking algorithm-design

• Updated Nov 25, 2021
• Swift

Static archive of the SUT Algorithm Design course, semester 1404-2

mkdocs persian algorithm-design mkdocs-material

• Updated Sep 2, 2026
• HTML

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

visualization python data-science machine-learning big-data deep-learning exploratory-data-analysis artificial-intelligence statistical-inference bayesian-inference data-mining-algorithms hypothesis-testing algorithm-design data-challenge

• Updated Mar 29, 2020
• HTML

Easy data compression algorithm.

open-source binary-data pattern-matching innovation data-compression data-processing compression-algorithm text-compression fsp algorithm-design file-compression delta-encoding computer-science-project similarity-detection lossless-compression efficient-storage lgpl-3-0 compression-technique

• Updated Sep 11, 2025
• HTML

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

algorithm graph approximation np-complete vertices vertex patullo noah noah-patullo vertex-cover algorithm-design noahpatullo approximation-algorithms patulo pattullo pattulo weighted-vertex-cover minimum-weighted-vertex-cover pricing-method edge-cost

• Updated Jan 12, 2019
• Java

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).

sorting algorithms mathematics recursion data-structures arrays big-o lecture-notes searching complexity-analysis divide-and-conquer algorithm-design 2023 study-material uniwa

• Updated Feb 16, 2026

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

algorithm javafx javafx-application quantization javafx-desktop-apps algorithm-design curriculum-design quantify curriculum-project

• Updated Jun 26, 2020
• Java