Project Euler Problem 2, solution internals related using ruby debugger

$ruby -rdebug euler-two.rb Debug.rb Emacs support available. /usr/lib/ruby/2.1.0/rubygems/core_ext/kernel_require.rb:57: RUBYGEMS_ACTIVATION_MONITOR.enter (rdb:1) r /usr/lib/ruby/2.1.0/rubygems/core_ext/kernel_require.rb:57: RUBYGEMS_ACTIVATION_MONITOR.enter (rdb:1) r /usr/lib/ruby/2.1.0/rubygems/core_ext/kernel_require.rb:57: RUBYGEMS_ACTIVATION_MONITOR.enter (rdb:1) next /usr/lib/ruby/2.1.0/rubygems/core_ext/kernel_require.rb:143: RUBYGEMS_ACTIVATION_MONITOR.exit (rdb:1) next euler-two.rb:3:n1, n2 = 1, 2 (rdb:1) next euler-two.rb:4:sum = 0 (rdb:1) print n1 1nil (rdb:1) print n2 2nil (rdb:1) next euler-two.rb:6:while n2 < 4000000 (rdb:1) print n2 2nil (rdb:1) next euler-two.rb:7:sum += …

BUBBLE SORT USING RUBY ARRAY SIZE 100

#!/usr/bin/ruby =begin bubble sort in php by detour@metalshell.com Generate random numbers then sort them. Ported to Ruby by Jeffrin Jose T Licensed : GPL =end array_size = 100 x = 0 y = 0 z = 0 hold = 0 ran = Array.new(array_size) while x < array_size ran[x] = rand(1..1000) x +=1 end x = …