find min recursion Algorithm

The find min recursion algorithm is a technique used in computer science to locate the smallest element in a given list or array, by leveraging the power of recursive function calls. The algorithm starts by comparing the first element of the array with the rest of the elements, replacing the current minimum value with any smaller value found during the comparison. The process is repeated for each element in the array until the smallest value is identified. This recursive approach breaks down the original problem of finding the minimum value in the entire array into smaller subproblems, making it easier to solve and understand.

The primary advantage of the find min recursion algorithm is its simplicity, as it follows a straightforward approach to locate the smallest element in an array. However, it may not be the most efficient solution for large datasets due to the overhead associated with recursive function calls. Each function call adds a new frame onto the call stack, which consumes memory and can potentially lead to a stack overflow error if the recursion goes too deep. Despite these drawbacks, the find min recursion algorithm remains a popular choice for teaching the concept of recursion and its applications in solving various programming problems.

 # Divide and Conquer algorithm
def find_min(nums, left, right):
    """
    find min value in list
    :param nums: contains elements
    :param left: index of first element
    :param right: index of last element
    :return: min in nums
 
    >>> nums = [1, 3, 5, 7, 9, 2, 4, 6, 8, 10]
    >>> find_min(nums, 0, len(nums) - 1) == min(nums)
    True
    """
    if left == right:
        return nums[left]
    mid = (left + right) >> 1  # the middle
    left_min = find_min(nums, left, mid)  # find min in range[left, mid]
    right_min = find_min(nums, mid + 1, right)  # find min in range[mid + 1, right]
 
    return left_min if left_min <= right_min else right_min
 
 
if __name__ == "__main__":
    nums = [1, 3, 5, 7, 9, 2, 4, 6, 8, 10]
    assert find_min(nums, 0, len(nums) - 1) == 1

find min recursion Algorithm

LANGUAGE:

DARK MODE:

PROGRAMMING LANGUAGES:

Python

Java

Javascript

C#

C++

C

Ruby

Scala

MATLAB

Kotlin

Rust

R

Go

	# Divide and Conquer algorithm
	def find_min(nums, left, right):
	"""
	find min value in list
	:param nums: contains elements
	:param left: index of first element
	:param right: index of last element
	:return: min in nums

	>>> nums = [1, 3, 5, 7, 9, 2, 4, 6, 8, 10]
	>>> find_min(nums, 0, len(nums) - 1) == min(nums)
	True
	"""
	if left == right:
	return nums[left]
	mid = (left + right) >> 1 # the middle
	left_min = find_min(nums, left, mid) # find min in range[left, mid]
	right_min = find_min(nums, mid + 1, right) # find min in range[mid + 1, right]

	return left_min if left_min <= right_min else right_min


	if __name__ == "__main__":
	nums = [1, 3, 5, 7, 9, 2, 4, 6, 8, 10]
	assert find_min(nums, 0, len(nums) - 1) == 1