Compare Number vs BigInt for big numbers

I created two arrays: one with 100 numbers and another with 10,000 random numbers. Then, i filtered the first array to check for the presence of the number 5 in the second array using two different methods. In the first test case, i used the .find() method, which iterates through the 10,000-number array to locate the number 5 and returns the first matching value. In the second test case, i converted the 10,000-number array into a Set and used the .has() method to check for the presence of the number 5. The goal is to compare both approaches and determine which one is faster and which one use less memory.

Measure the performance of the Power and Square Root functions. Conclusion: The underlying math logic seems to be the same, regardless of the function used.

Measures performance between using arr.at(-1) to access the last element in the array and arr[arr.length - 1]

Measures performance between using arr.at(-1) to access an element in an array and arr[arr.length - 1]