💡 Build your own programming language! A C++17 PEG parser generator supporting parser combination, memoization, left-recursion and context-dependent grammars.

Códigos-fontes desenvolvidos durante a disciplina "CIC0169 - Programação Competitiva" do Departamento de Ciência da Computação da Universidade de Brasília.

C Code Source Metrics - tool to gather simple metrics from C code

📚Solutions for algorithms covered in Stanford Algorithms Specialization

Python binding for Reticula: the general purpose library for analysing static, temporal and hypergraph networks.

Just a fun challenge for me. Trying to maintain a consistent streak on Github by solving one coding challenge every day.

Difference between bubl and heap sort

A tool for inferring program complexity, e.g., O(nlogn), O(n^2), O(2^n). Dynaplex uses dynamic analysis to infer recurrence relations and then solve them for closed form solutions representing program complexity bounds.

Openframeworks version of Local Entropy Filter for image

This repository is learn C++ besides Python and prepare later to implement machine learning algorithms on C++

This repository consists of codes written during my undergraduate Design and Analysis of Algorithms course!

Algorithm Analysis of Insertion sort, Merge sort and Hybrid sort

Implementaciones de Fibonacci en C++ con diferentes complejidades y técnicas

CL = Command Line. GREP is a command-line utility for searching plain-text data sets for lines that match a regular expression or simply a string

Divide and Conquer technique is used to work out different problems of varyying natures. Our problem at hand is to efficiently search an integer value from grid of size n x n, where n is any integer, using the principles of divide and conquer. The grid has both it's rows as well as columns sorted in ascending order.

Prime generator, used to compare different algorithms for generating prime numbers.

(EN) Final Project for Algorithm Complexity Analysis | (ID) Tugas Akhir Mata Kuliah Analisa Kompleksitas Algoritma

Faster algorithms for RNA-folding using the Four-Russians method

UCLA CS32 Projects: a dive into object oriented developement (overloading, inheritence, polymorphism), data structures (stacks, queues, lists, trees, etc.), and algorithms (searching, sorting, complexity).

Queued Assembler Interpreter