leocode/algorithms

Hub for algorithms solutions and data Structures in various languages

Algorithms

This repository is created as a good start for contributing open source at Hacktoberfest 2019. It's mostly dedicated for beginners and first-timers this year, but anyone is welcome. Take a look at Issues and take one that fits you.

algorithms's Issues

BucketSort Implementation

Write code in your favorite language that solves sorting with the bucket sort method.

Who doesn't have a pair?

The party is tonight. We've got a few hours left and I'm not sure that everybody is going to have somebody to talk to. People are paired by age. Here, take this list of ages of people who'll appear for sure. Please, if you find somebody without a pair, tell me how old they are so we can try to find somebody for them.

Example of usage # 1:

aloneAtParty([25, 19, 21, 25, 21]);

Expected output # 1:

> The person alone is 19 years old.

Example of usage # 2:

aloneAtParty([25, 19, 21, 25, 21, 19])

Expected output # 2:

> Everybody's got a pair.

Additional info:

There won't be more than 1 person without a pair.

How long until the alarm goes off?

Nobody wants to be late at work. I'm not that good at calculating the perfect time to go to sleep. I want your help with that. Define a function, which tells me, for how long I will have been sleeping since now.

Example of usage:

alarm('5:30');

Expected output/return value when run at 23 (11 PM):

> I will have been sleeping for 6 hours and 30 minutes.

Additional info:

We'll use 24-hour time format.

TreeSort Implementation

Write code in your favorite language that solves sorting with the tree sort method.

Median of medians

Write code in your favorite language that solves the median of the medians algorithm.