Run results for: sort vs sorted insert

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/105.0.0.0 Safari/537.36

Browser: Chrome 105

Operating system: Windows

Device Platform: Desktop

Date tested: 2 years ago

Test name	Executions per second
sort	107.5 Ops/sec
insert	30.5 Ops/sec

Tests:

sort
var arr = []; var comparator = (a,b)=>{ var length = a.length; for(var i=0; i<length; i++){ if (a[i]<b[i]) {return -1;} else if(a[i]>b[i]) {return 1;} } return 0; }; for (var i=0; i<10000; i++){ var a1 = Math.random(); var a2 = Math.random(); var a3 = Math.random(); var a4 = Math.random(); arr.push([a1,a2,a3,a4]); } arr.sort(comparator); console.log(arr[arr.length-1]);
insert
var arr = []; var comparator = (m,val)=>{ var length = m.length; for(var i=0; i<length; i++){ if (m[i]>val[i]) {return false;} } return true; }; var find_position = (arr,val)=>{ var l=-1; var r=arr.length; while(l<r-1){ var m = Math.floor((l+r)/2); if (comparator(arr[m],val)) { l=m; } else { r=m; } } return l; }; for (var i=0; i<10000; i++){ var a1 = Math.random(); var a2 = Math.random(); var a3 = Math.random(); var a4 = Math.random(); var row = [a1,a2,a3,a4]; var new_position = find_position(arr,row)+1; arr.splice(new_position,null,row); } console.log(arr[arr.length-1]);