Python binary search and Quick Sort instances

Python binary search and Quick Sort instances

The idea is simple and there are a lot of details. I thought it was very simple to write two small programs and found bugs frequently.

# Usr/bin/env pythondef binary_search (lst, t): low = 0 height = len (lst)-1 quicksort (lst, 0, height) print lst while low <= height: mid = (low + height)/2 if lst [mid] = t: return lst [mid] elif lst [mid]> t: height = mid-1 else: low = mid + 1 return-1def quicksort (lst, left, right ): low = left high = right key = lst [left] if left> = right: return 0 while low  
Summary
 
The above is a detailed explanation of the python binary search and quick sorting examples introduced by xiaobian. I hope it will help you. If you have any questions, please leave a message and I will reply to you in a timely manner. Thank you very much for your support for the help House website!