complexity-algorithm

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

Estruturas de Dados 2, 3º Período, Curso Superior de Bacharelado em Sistemas de Informação do IFNMG Campus Januária.

This is our repo for CS112 - Design and Analysis of Algorithm, Spring 2021, University of Information Technology, VNU HCM

Projeto algorithms - Projeto avaliativo da Trybe do Bloco 35: Algoritmos

E0224:Computational_Complexity_Theory is a course on theoretical foundation of computer science at CSA department IISc

The project aims to develop a mobile application using accelerometer data for time series analysis to detect heavy drinking patterns, prioritizing user privacy and data security. The goal is to provide insights into drinking habits, promote responsible consumption, and enable early intervention for alcohol-related harm.

experiments in calculating longest common subsequences of a set of strings (NP-Complete problem)

A disciplina discute as principais formas, técnicas, algoritmos e estruturas para organizar, classificar e recuperar as informações na memória de sistemas computacionais. Também possibilita a avaliação da complexidade das soluções adotadas para o armazenamento da informação nos sistemas computacionais.

Logic challenges with time and space complexity of algorithms.

Logic; Ability to interpret problems; Ability to interpret legacy code; Ability to optimize problem resolution and; Solve problems/Optimize algorithms.

Project Algorithms Python

Algorithm for counting inversions numbers to sort a vector using MergeSort

Implementation of R package for the travelling salesman problem.

push swap aims to optimise an algorithm as much as you can, with a fixed amount of movements available to you

Logic challenges with time and space complexity of algorithms.

Algorithm for the computation of Multichannel Distribution Entropy (MDistEn).

Resources and exercises done for the Algorithmic Methods in Problems Resolution ("Métodos algorítmicos en resolución de problemas") subject.

This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves.

Builds heap according to selected time complexity algorithm.