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.

My personal repository with algorithm challenges

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.

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

Алгоритмы: Материалы для экзамена.

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.

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

A performance comparison between different sorting algorithms

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…

A Clojure project that solves the fraud problem

Membandingkan kompleksitas algoritma sorting : BubbleSort dan MergeSort

Comparison of sorting methods (QuickSort, HeapSort and MergeSort)

Membandingkan 2 strategi algoritma : Brute Force (implementasi SelectionSort) dan Divide and Conquer (MergeSort)

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.

A simple program demonstrating O(n*log(n)) search on a monotonic matrix, versus the O(n**2) search required for a non-monotonic matrix.

Java program that plays with some concepts related to graph algorithms and their complexities.