Python binary search and Quick Sort instances

Source: Internet
Author: User

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  


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!

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.