An implementation of the bubble sort algorithm in Ruby

Link to the requirements in the Odin Project

bubble_sort([3, 5, 1, 14, 4, 19, 3, 2, 1, 0, 99])
=> [0, 1, 1, 2, 3, 3, 4, 5, 14, 19, 99]

bubble_sort_by %w[house tree apples] do |left, right|
  left.length - right.length
end
=> ["tree", "house", "apples"]

• Ruby
• Used rubocop for linting

👤 Luis Saavedra

• Github: @nriqu322
• Twitter: @nriqu322
• Linkedin: Luis Saavedra

👤 Oscar Mier

• Github: @voscarmv
• Twitter: @voscarmv
• Linkedin: Oscar Mier

Contributions, issues and feature requests are welcome!

Feel free to check here for issues.

Give a ⭐️ if you like this project!