Benchmark: Find index in string with recursion vs findIndex

Script Preparation code:

var sampleString = 'abcdefghijklmnopqrstuvwxyz';

var recurseFindIndex = (charArray, i = 0) => {
  const [curr, ...rest] = charArray;
  if (curr === 'z') return i;
  else return recurseFindIndex(rest, i + 1);
};

Tests:

findIndex
sampleString.split('').findIndex(char => char === 'z');
Recursion
recurseFindIndex(sampleString);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
findIndex
Recursion

Fastest: N/A

Slowest: N/A

ⓘ Get performance results from real users on your website with Request Metrics.

Website Performance Monitoring by Request Metrics

Latest run results:

Run details: (Test run date: 4 days ago)

User agent: Mozilla/5.0 (iPhone; CPU iPhone OS 16_3 like Mac OS X) AppleWebKit/605.1.15 (KHTML, like Gecko) CriOS/111.0.5563.72 Mobile/15E148 Safari/604.1

Browser/OS: Chrome Mobile iOS 111 on iOS 16.3

View result in a separate tab

Test name	Executions per second
findIndex	2777002.0 Ops/sec
Recursion	163935.2 Ops/sec

Find index in string with recursion vs findIndex (version: 0)

What's faster to locate a character's index within a string, findIndex or recursion?

Comparing performance of: findIndex vs Recursion

Created: 5 days ago by: Guest

Jump to the latest result

findIndex

Recursion

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A