What is the best way to get the minimum or maximum value from an Array of numbers?

by

The theoretical answers from everyone else are all neat, but let’s be pragmatic. ActionScript provides the tools you need so that you don’t even have to write a loop in this case!

First, note that Math.min() and Math.max() can take any number of arguments. Also, it’s important to understand the apply() method available to Function objects. It allows you to pass arguments to the function using an Array. Let’s take advantage of both:

var myArray:Array = [2,3,3,4,2,2,5,6,7,2];
var maxValue:Number = Math.max.apply(null, myArray);
var minValue:Number = Math.min.apply(null, myArray);

Here’s the best part: the “loop” is actually run using native code (inside Flash Player), so it’s faster than searching for the minimum or maximum value using a pure ActionScript loop.

More Related Contents:

  1. Complexity of absolute difference and sum
  2. How to find nth prime with complexity o(1)
  3. What is a plain English explanation of “Big O” notation?
  4. Big O, how do you calculate/approximate it?
  5. How can I find the time complexity of an algorithm?
  6. Constant Amortized Time
  7. Is log(n!) = Θ(n·log(n))?
  8. How can building a heap be O(n) time complexity?
  9. How to find the lowest common ancestor of two nodes in any binary tree?
  10. What’s the fastest algorithm for sorting a linked list?
  11. What would cause an algorithm to have O(log log n) complexity?
  12. What is Constant Amortized Time?
  13. Programmatically obtaining Big-O efficiency of code
  14. Sorting in linear time? [closed]
  15. How to deal with Number precision in Actionscript?
  16. Big-oh vs big-theta [duplicate]
  17. Why do we ignore co-efficients in Big O notation?
  18. Time Complexity of two for loops [duplicate]
  19. Prove that binary heap build max comparsion is (2N-2)
  20. Explanation of Algorithm for finding articulation points or cut vertices of a graph
  21. How can I get an instance’s “memory location” in ActionScript?
  22. Why is bubble sort O(n^2)?
  23. how to determine if the kth largest element of the heap is greater than x
  24. Do iterative and recursive versions of an algorithm have the same time complexity?
  25. Flex’s FileReference.save() can only be called in a user event handler — how can I get around this?
  26. Computational complexity of base conversion
  27. How to apply binary search O(log n) on a sorted linked list?
  28. How do I search for a number in a 2d array sorted left to right and top to bottom?
  29. The sieve of Eratosthenes in F#
  30. Unbiased random number generator using a biased one

Leave a Comment