Bubble Sort Algorithms

Implementation of bubble_sort and bubble sort by algorithms as outlined here by the Odin Project.

A sorting algorithm that takes an array of elements as input, each element is then 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.

Built With

• Ruby

Live Demo

Live Demo Link (repl.it)

Getting Started

Open the live demo link above and run either of the code demonstrations below

ruby bubble_sort.rb

or

ruby bubble_sort_by.rb

Prerequisites

• Ruby

Setup

To run this project locally, please ensure you have Ruby installed on your machine, then clone this repository by running.

git clone https://github.com/descholar-ceo/bubble-sort

After cloning run

cd bubble-sort

Lastly run either of the commands listed in the getting started section above.

Authors

👤 Mugirase Emmanuel

• Github: @descholar-ceo
• Twitter: @descholar3
• Linkedin: MUGIRASE Emmanuel

👤 Mark Rode

• Github: @m15e

Show your support

Give a ⭐️ if you like this project!

Acknowledgments

• Microverse
• The Odin Prohect

📝 License

This project is MIT licensed.