From 4e314dd1ffc3bae8f6c3b4cbb4c1bcaebee0a1da Mon Sep 17 00:00:00 2001 From: Angelos Chalaris Date: Wed, 14 Feb 2018 13:45:47 +0200 Subject: [PATCH] Update mostPerformant.md --- snippets/mostPerformant.md | 8 +++----- 1 file changed, 3 insertions(+), 5 deletions(-) diff --git a/snippets/mostPerformant.md b/snippets/mostPerformant.md index 192c85a90..2185b7a29 100644 --- a/snippets/mostPerformant.md +++ b/snippets/mostPerformant.md @@ -2,11 +2,9 @@ Returns the index of the function in an array of functions which executed the fastest. -Use `Array.map()` to generate an array where each value is the total time taken to execute the function -after `iterations` times. Use the difference in `performance.now()` values before and after to get the total time -in milliseconds to a high degree of accuracy. -Use `Math.min()` to find the minimum execution time, and return the index of that shortest time which -corresponds to the index of the most performant function. Omit the second argument, `iterations`, to use a default of 10,000 iterations. The more iterations, the more reliable the result but the longer it will take. +Use `Array.map()` to generate an array where each value is the total time taken to execute the function after `iterations` times. Use the difference in `performance.now()` values before and after to get the total time in milliseconds to a high degree of accuracy. +Use `Math.min()` to find the minimum execution time, and return the index of that shortest time which corresponds to the index of the most performant function. +Omit the second argument, `iterations`, to use a default of 10,000 iterations. The more iterations, the more reliable the result but the longer it will take. ```js const mostPerformant = (fns, iterations = 10000) => {