big-o-performance
There are 30 repositories under big-o-performance topic.
mjebrahimi/DotNet-Collections-Benchmark
🚀 A comprehensive performance comparison benchmark between different .NET collections.
trunghieu-tran/LeetCode-Solutions-And-Data-Structure-Analysis
A collection of LeetCode novel solutions that is implemented in Java. An overview about data structure for interview questions
Rion5/LeetCodeSolutions
C# Solutions for Algorithm Style Programming Questions found on LeetCode
msabr027/time_complexity
The objective is to build a library to be able to estimate time complexity for machine learning algorithms
seanemery1/magic-squares
Magic Square Finder in Java using combination trees and object-orientated design principles. The algorithm will search and find all N*N magic squares.
mmahmoodictbd/charging-station-sessions
EVBox Charging Station Sessions APIs
mupezzuol/searching-sorting-algorithms
Implementation of searching and sorting algorithms, written by me in Java with TDD.
lussierc/simplePerformanceExperimentsJava
A Java project that does performance analyses for user-selected computations & lengths.
williamkoller/introduction-analysis-algorithms-big-o
Introdução à análise de Algoritmo e Big-O
ajbax-cmd/Big-O-Notation
CPS162 Fall 2021 Group1: Gabriela Fernandez Leon, Tan Dinh, Alan Baxley
rosberglinhares/DataStructuresAndAlgorithms
Core data structures and algorithms implemented in Java from scratch. Very useful to crack the coding interviews at top tech companies.
elbaulp/Data-Structures-and-Algorithms
Scala project hosting exercies on Data Structures and Algorithms of the Android app Data Structures & Algorithms
vivekdogra02/javascript-data-structures
A Project in JavaScript to understand different data structures like linked lists, hash tables, Queues, sorting, searching, graphs, etc, and how they are being structured. It is a great learning project and available for some contributors also.
Augusto11CB/Data-Structures-And-Algorithms
Repository of code references, notes and observations on data structure and algorithm studies.
J0K3Rn/Data_Structures_Projects
Projects and tests for COSC2430 Data Structures taken at the University Of Houston
kocsisbalazs/Big-O-notations
🐇 Every big-O notation with example codes
mupezzuol/java-data-structures
This repository contains some Data Structures implemented from scratch using Java.
Pascal273/7th-Project-Solve-Problems-Using-Algorithms
Deconstruction of a computational problem... 3 algorithms to find the best possible combination of shares for investors (based on list of shares) while making use of dynamic programming.
bpbirch/DictQueue
I had the goal of creating a queue whose performance for both enqueuing and dequeueing would be O(1). To achieve this, instead of using a list, I wrote a dictionary queue structure, DictQueue.
gabrielsilper/python-project-algorithms
Python Algorithms + Pytest
jackr276/Time-Complexity-of-Sorting-Algorithms
An implementation of various sorting algorithms as well as a Binary Search Tree.
jos3neto/primality-algorithm
Algorithm that tests for prime numbers, with O(√n) time complexity.
Kaydayo/TwoSum_Optimized
A function that returns the two numbers that add up to a target in any given array
nirmalnishant645/College-Activity
Different lectures on approaching the problems asked in Job Interviews that are available on LeetCode.
peterchege/data-structures
This repo includes examples of data structures and algorithms that you can use during revisions. I have highlighted their performance in regards to the order of growth in the big-o notation categories.
rajagopal28/n26-transaction-statistics
A REST bases transaction statistics application created as part of N26 take-home assessment task. This is a shortlisted solution.
TomPlum/learn-java-dsa
Learning common Data Structures & Algorithms used in the Java programming language.
treelover28/search-algorithms-comparison
Compare 3 simple search algorithms and their running time growths in Big-O notations
YashChat/Max-Product-Grid
Given an N × N grid of integers and an integer M ≤ N , determine the maximum product that can be made from M integers that are next to each other in the grid (horizontally, vertically, or diagonally.)