algorithm-complexity

Benchmark a given function for variable input sizes and find out its time complexity

Classic algorithms including Fizz Buzz, Bubble Sort, the Fibonacci Sequence, a Sudoku solver, and more.

Optimized AKS Primality Test with Fast Fourier Transform (FFT) for enhanced performance in large number primality checking. This implementation improves the efficiency of the AKS algorithm using FFT for polynomial multiplication, offering significant speedup.

My personal repository with algorithm challenges

Three published algorithms for inter-reconfigurable robots: fusion/fission FSM, modified multi-A* path planning, and hierarchical GBNN dual-arm coverage. Unified pygame demo. Cross-platform.

My solutions for Bilkent University CS202 Fundamental Structures of Computer Science homework assignments (Spring 2019).

A short Java-based project that explores the problem of determining if a target sum can be achieved using elements from a given array, employing both a basic recursive approach and an optimized version using memoization

This Java program defines two functions, howSum and improvedHowSum, to find a combination of numbers that add up to a given target sum, using a simple recursive approach and a more efficient recursive approach with memoization, respectively.

This repository features Data Structures and Algorithms (DSA) practices in Dart, focusing on mastering fundamental programming concepts and problem-solving techniques.

Algorithm&Complexity course by Prof. Xiaofeng Gao in SJTU CS including slides, assignments and project of Group Tour-Recommendation

💫 CSALCOMP: ALGORITHMS AND COMPLEXITY

Academic projects in Python and C exploring data structures, algorithms, and computational complexity, developed during my Computer Engineering degree at UNISAL.

This project is a C program designed to classify triangles based on their side lengths as Equilateral, Isosceles, Scalene, or Invalid and calculate the area for valid triangles, aimed at demonstrating basic geometric and mathematical concepts in programming.

A powerful VS Code extension that analyzes the algorithmic complexity (Big O notation) of your code using a high-performance Rust WASM engine. Get instant insights into your code's performance characteristics with beautiful visualizations and detailed reports.

This is a project I did to resume my newly acquired knowledge about sorting algorithms, search algorithms and algorithm complexity after finishing the 'Data Structures and Algorithms' course at my University.

Data structures and algorithms for interviews

✨ A daily journal of algorithms — where every solved problem becomes a story. 🧠 Tracking my journey through LeetCode while nurturing a consistent streak on GitHub 🌱 📅 One problem, one commit, every day — building habits and dreams line by line 💖

Tired of searching for complexities in those huge reference books and Googling all over the internet, just for knowing a complexity of a particular Data Structure or Algorithm? This app is just for you! Yes! Complexities are just one tap away! Yes! Don’t forget to attempt the amazing quiz provided. Compete against yourself! Your high score is re…

Membandingkan kompleksitas waktu Padovan Sequence secara Rekursif dan Dynamic Programming (DP)