andrewkowalik

def powers_rec(num,power)
  return num if power == 1
  
  total = num * powers_rec(num,power-1)
end

andrewkowalik

def quick_sort(nums)
  return nums if nums.length == 1
  
  mid = nums.length / 2
  left = []
  right = []
  
  0.upto(nums.length-1) do |i|
    if nums[i] <= nums[mid]
      left << nums[i]

andrewkowalik

def prime(num)
  return [] if num < 2
  primes = []
  2.upto(num) { |x| primes[x] = x}
  2.upto(Math.sqrt(num)) { |x| primes[x] ? (x*x).step(num,x) { |x2| primes[x2] = nil } : next}
  primes.compact
end

andrewkowalik

def range(start_num,end_num)
  return [end_num] if start_num == end_num
  nums = []
  if start_num > end_num
    nums += [start_num] + range(start_num-1,end_num)
  else
    nums += [start_num] + range(start_num+1,end_num)
  end
  nums
end