To the Top
File:  root - text - article - 2020 - 01 - max-and-min-with-limited-comparisons.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 488 Views, 30498 Search Bots | 58 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Microsoft:

Given a list of numbers of size n, where n is greater than 3, find the maximum and minimum of the list using less than 2 * (n - 1) comparisons.

Here's a start:


def find_min_max(nums):
# Fill this in.

print find_min_max([3, 5, 1, 2, 4, 8])
# (1, 8)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 488 Views, 30498 Search Bots | 58 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Running Median
  2. ImageMagick Vulnerabilities -  CVE-2016–3714
  3. Algorithm Interview: Make the Largest Number
  4. Daily Interview Problem: Merge List Of Number Into Ranges
  5. First and Last Indices of an Element in a Sorted Array
  6. Daily Interview Problem: Maximum Profit From Stocks
  7. Algorithm Interview: Longest Consecutive Sequence
  8. Plus One
  9. [Daily Problem] Longest Palindromic Substring
  10. Daily Interview Problem: Look and Say Sequence

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">