⏱ TIME COMPLEXITY ANALYSIS ⏱ Use Python to analyze and answer questions about the texts and calls contained in the dataset. Then, perform run time analysis of the solution and determine its efficiency ⏱

This Repository contains the CodeForces contests problems analysis and it's one of the most optimized solutions.

Efficiency test of different algorithms used to simulate the spread of a wildfire.

Explore problem-solving with various data structures and algorithms using vanilla JavaScript, including polyfills

C++ based sorting algorithm runtime generator that carries out different sorting operations on very large randomized datasets and records the time taken to complete the sort. University of the West Indies, STA, Computer Science, Data Structures and Algorithms Project.

CSCI570 Analysis of Algorithms Project: Sequence Alignment Problem

Numerical investigation into the distributional analysis of the time complexity of Euclid's algorithm. Sheds numerical light on an "obscure" constant related to a certain variance.

Implementing a priority queue with a maxheap and then with a treap and comparing the results.

Data Structure Lecture Notes & Assignment

Sorting Algorithms with C

Implementazione BinaryTree e RedBlackTree, valutandone la complettà temporale in caso di inserimento e ricerca

Rješenje konkretnog problema iz teorije grafova koje još zadovoljava zadanu gornju ogradu na vremensku složenost. Problem sam riješio u programskom jeziku C++ korištenjem algoritma pretraživanja u širinu. Nastalo u prosincu 2021. kao domaća zadaća iz redovnog kolegija Oblikovanje i analiza algoritama. Prezentirano u siječnju 2022.

Implementing class objects, analyzing time complexity, and applying a binary search algorithm to determine useful information in a sample dataset.

Understanding Big O Notation: A Comprehensive Guide to Time Complexity Analysis

Notes on Refactoring Exponential Macros in Common Lisp

Implementation of InsertionSort and MergeSort and valutation of time complexity

Advanced Data Strucutres and Algorithm Design

Algorithmic complexity comparison