Advanced Sorting Algorithms (Bubble Sort)

One of the simpler (but more processor-intensive) ways of sorting a group of items in an array is Bubble Sort, 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.

This project was completed in line with standards provided by Microverse.

See a simple demo below

Technologies

• Ruby

Getting Started

Clone the repository to your local machine

$ git clone https://github.com/kobiyoyo/Bubble-Sort.git

navigate cd into the cloned directory

$ cd bubble-sort

Authors

👤 Adama Chubiyojo Desmond

• Github
• Twitter
• Linkedin
• Email

👤 Danilo Zagarcanin

• Github
• Twitter
• Linkedin
• Email

Contributing

1. Fork it (https://github.com/kobiyoyo/Bubble-Sort/fork)
2. Create your feature (dev) branch (git checkout -b feature/[choose-a-name])
3. Commit your changes (git commit -m 'What this commit will fix/add')
4. Push to the branch (git push origin feature/[chosen name])
5. Create a new Pull Request

License

This project is licensed under the MIT License - see the LICENSE file for details