# Smallest Integer

# I worked on this challenge [by myself, with: ].

# smallest_integer is a method that takes an array of integers as its input
# and returns the smallest integer in the array
#
# +list_of_nums+ is an array of integers
# smallest_integer(list_of_nums) should return the smallest integer in +list_of_nums+
#
# If +list_of_nums+ is empty the method should return nil

# Your Solution Below
def smallest_integer(list_of_nums)
  list_of_nums.empty? ? return : list_of_nums.sort!
  list_of_nums[0]
end

# Smallest Integer

# I worked on this challenge [by myself, with: ].

# smallest_integer is a method that takes an array of integers as its input
# and returns the smallest integer in the array
#
# +list_of_nums+ is an array of integers
# smallest_integer(list_of_nums) should return the smallest integer in +list_of_nums+
#
# If +list_of_nums+ is empty the method should return nil

# Your Solution Below
def smallest_integer(list_of_nums)
  list_of_nums.empty? ? return : list_of_nums.sort!
  list_of_nums[0]
end

# Alternative solution
# def smallest_integer(list_of_nums)
	# sm = list_of_nums[0]
	# list.each do |x|
		# sm = x if x < sm
	# end
# end

Add verbose solution as well
Add verbose solution as well
