Skip to content

Implementation of most common data structures and sorting algorithms

Notifications You must be signed in to change notification settings

mateusgpereira/datastructures-sorting

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 

Repository files navigation

Data Structures & Sorting

Implementation of most common data structures and sorting algorithms.

I was taking some time to practice and learn more about data structures and sorting algos.
Then I decide to create this repo with some notes, examples and short explanations.

Data Structures

Comming soon ...

Sort

We almost never would have to implement our own sorting algorithms.
Most of them are already builtin in the languages or libraries that we use.
But it's important to understand how to use and which one to use according
to the problem we are trying to solve.

Bubble Sort

Consists and comparing a pair of values and swaping them if the first is greater than the second.

Is not very efficient, I don't see it been using in real projects, only for learning purposes.

Time complexity O(n²)
Space complexity O(1)

Examples:
Java
Tests

cd sort/java/
mvn -Dtest=BubbleSortTest test

JavaScript
Tests

cd sort/js/
yarn test -- bubble-sort.test.js

About

Implementation of most common data structures and sorting algorithms

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published