Pinned

1. terpsichore terpsichore Public

   Contribute to My Terpsichore's code base. Create a feature, fix an error, or help maintain this open source community that we all love.

   JavaScript 1

2. Bubble Sort Challenge Bubble Sort Challenge

   1

   require 'pry'

   2

   3

   puts "Bubble Sort"

   4

   # 1. bubble_sort takes in a single array parameter.

   5

   # 2. If the array size is 1 or 0, return the array; by default, 

3. Quick Sort Challenge in Ruby Quick Sort Challenge in Ruby

   1

   require 'pry'

   2

   3

   puts "Quick Sort"

   4

   # 1. First, our checks to see if array.length <= 1.

   5

   # 2. Pick a pivot at random. Ruby’s delete_at method will delete the item at the specified index, which in this case would be a rand index in the range of array.length. We’re saving the value of that item to pivot.

4. Selection Sort Challenge Selection Sort Challenge

   1

   require 'pry'

   2

   3

   puts "Selection Sort"

   4

   5

   # 1. Set n equal to array.length — 1: this represents how many times you need to do the comparisons. Loop though n.times.

5. Merge Sort-Ruby Merge Sort-Ruby

   1

   require 'pry'

   2

   3

   puts "Merge Sort"

   4

   # 1. Check the input array length. If it is 0 or 1, return the array (already sorted!)

   5

   # 2. If array length is greater than 1, then we want to define a mid-point, picked by choosing array.length / 2 and call a floor method so the number always rounds down.

6. Stairs Challenge_Ruby Stairs Challenge_Ruby

   1

   puts "Stairs Challenge"

   2

     # Given

   3

     # x = the number of steps to the top of a stair

   4

     # and

   5

     # n = is the maximum stride to be taken