Bubble Sort

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller or larger elements "bubble" to the top of the list. Wikipedia

Bubble sort collaborative project

Bubble Sort solution for both strings and integers using Ruby language.

Built With

• Ruby Programming Language

Getting Started

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

1. Go to "https://github.com/mahbubul14/bubble_sort/tree/project-1"
2. Click on the green button with text "code" and copy the HTTPS/SSH URL
3. In your computer, open your terminal application, type in git clone followed by the link you copied
4. Run git checkout -b your-branch-name. Make your contributions
5. Push your branch up to your forked repository: git push -u origin your-branch-name
6. Open a Pull Request with a detailed description of the development branch of the original project for a review

Author

👤 Mahbub Alam

• GitHub: @githubhandle
• Twitter: @twitterhandle
• LinkedIn: LinkedIn

🤝 Contributing

Contributions, issues, and feature requests are welcome!

Show your support

Give a ⭐️ if you like this project!