Sorting algorithms are some of the earliest that you typically get exposed to in Computer Science. It may not be immediately obvious how important they are, but it shouldn’t be hard to think of some examples where your computer needs to sort some massive datasets during everyday operations.
In this project, we have written a bubble sort algorithm, split into two methods. The first one is going to sort smallest to highest and the other one is going do the same with yield and block part.
- Ruby 2.6
In order to start with the project:
- You need to have ruby environment installed. Click here for instructions
- Clone this repository
https://github.com/bertil291utn/bubble-sort-project.git - Run the algorithm file
- In a terminal window write
ruby[your_file_path]buble-sort-algorithm.rb
- In a terminal window write
👤 Bertil Tandayamo
- Github: @bertil291utn
- Twitter: @btandayamo
- Linkedin: Bertil Tandayamo
👤 Bekhzod Akhrorov
- Github:@Bekhzod96
- Twitter: @Begzod
- Linkedin:@Bekhzod AKhrorov