fork download
copy 
  1. def findMin(arr, left, right):
  2.  
  3.     if left == right:
  4.         return arr[left]
  5.     else:
  6.         m = (left + right) >> 1
  7.         a = findMin(arr, left, m);
  8.         b = findMin(arr, m + 1, right)
  9.         if a < b:
  10.            return a
  11.         else:
  12.            return b
  13.  
  14. def main():
  15.  
  16.     arr = [1,23,-13,421,5,10];
  17.     min = findMin(arr, 0, len(arr) -1)
  18.     print(min)
  19.  
  20. main()
Success #stdin #stdout 0.03s 9204KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-13
https://ideone.com/9deMfw
Finding Min Array Divide et Impera.
language:
Python 3 (python  3.9.5)
created:
3 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!