How to find max. and min. in array using minimum comparisons?

by 
1. Pick 2 elements(a, b), compare them. (say a > b)
2. Update min by comparing (min, b)
3. Update max by comparing (max, a)

This way you would do 3 comparisons for 2 elements, amounting to 3N/2 total comparisons for N elements.

More Related Contents:

  1. Print two-dimensional array in spiral order
  2. In-place array reordering?
  3. How to find repeating sequence of characters in a given array?
  4. maximize the top element of the stack after performing exactly K operations
  5. Algorithm for all subsets of Array
  6. How to sort in-place using the merge sort algorithm?
  7. Searching array reports “not found” even though it’s found
  8. Finding three elements in an array whose sum is closest to a given number
  9. How to find the kth smallest element in the union of two sorted arrays?
  10. Algorithm to find k smallest numbers in array of n items
  11. Can min/max of moving window achieve in O(N)?
  12. Weighted random selection from array
  13. Find the Smallest Integer Not in a List
  14. How to find a duplicate element in an array of shuffled consecutive integers?
  15. Binary Search in Array
  16. Find the majority element in array
  17. Given an array, find out the next smaller element for each element
  18. Finding neighbours in a two-dimensional array
  19. Binary Search algorithm implementations
  20. Algorithm to determine if array contains n…n+m?
  21. Find the 2nd largest element in an array with minimum number of comparisons
  22. Algorithm to rotate an array in linear time
  23. Find all subsets of length k in an array
  24. Median of 5 sorted arrays
  25. find pair of numbers in array that add to given sum
  26. Regarding in-place merge in an array
  27. Interview question: three arrays and O(N*N)
  28. Maximum sum of non consecutive elements
  29. calculating the number of “inversions” in a permutation
  30. Find the first element in a sorted array that is greater than the target

Leave a Comment