Bubble Sort Algorithm

This project is about implementing the simple but slow bubble sorting algorithm.

It will compare numbers in an array and swap two adjacent number if the one on the left is bigger than the one on the right,until every number will be sorted in ascending order.

Built With

• Ruby 2.6.5
• Linted with Rubocop
• Love & Patience

Live Demo

Live Demo Link

Open bubble_sort.rb in repl.it and play with it

Getting Started

To get a local copy up and running follow these simple example steps.

Prerequisites

Ruby 2.. or superior version installed and running

Setup

Clone the repo into your system

Usage

Give an array of numbers or strings and it will order them for you in ascending order using bubble sort algorithm

Just run the filename inside IRB or any terminal

Authors

👤 Illuminato Salvatore

• Github: @ioilmio
• Twitter: @ioilmio
• Linkedin: Illuminato Salvatore

👤 Guilherme Recordòn

• Github: @guirecordon
• Twitter: @RecordonG
• Linkedin: Guilherme Recordòn

🤝 Contributing

Contributions, issues and feature requests are welcome!

Feel free to check the issues page.

Show your support

Give a ⭐️ if you like this project!

Acknowledgments

• Hat tip to anyone whose code was used
• Inspiration
• etc

📝 License

This project is MIT licensed.