In this project, we were asked to build a bubble sorting algorithm where each element is compared to the one next to it and they are swapped if the one on the left is larger than the one on the right. This continues until the array is eventually sorted.
- RUBY
Contributions, issues and feature requests are welcome! Start by:
- Forking the project
- Cloning the project to your local machine
cd
into the project directory- Run
git checkout -b your-branch-name
- Make your contributions
- Push your branch up to your forked repository
- Open a Pull Request with a detailed description to the development branch of the original project for a review
👤 Brittany Blake
- Github: @BrittanyBlake
- Twitter: @bbcodes_
- Linkedin: Brittany Blake
👤 Davis Dambis
- Github: @davisdambis
- Twitter: @DDambis
- Linkedin: Davis Dambis
Give a ⭐️ if you like this project!
This project is MIT licensed.