i have a huge 2d array with the coordiantes of vertexes of hexagons. which looks like this:
let arr = [
[150.3073578016,95.9815785601,149.1526572632,97.9815785601,150.3073578016,99.9815785601,152.6167588783,99.9815785601,153.7714594167,97.9815785601,152.6167588783,95.9815785601],
[120.5738189383,54.4815785601,121.7285194767,54.4815785601,122.3058697459,55.4815785601,121.7285194767,56.4815785601,120.5738189383,56.4815785601,119.9964686691,55.4815785601],
[119.9964686691,78.4815785601,122.3058697459,78.4815785601,123.4605702842,80.4815785601,122.3058697459,82.4815785601,119.9964686691,82.4815785601,118.8417681307,80.4815785601],
[115.6663416502,100.9815785601,117.9757427269,100.9815785601,119.1304432653,102.9815785601,117.9757427269,104.9815785601,115.6663416502,104.9815785601,114.5116411118,102.9815785601],
[124.326595688,100.9815785601,126.6359967648,100.9815785601,127.7906973032,102.9815785601,126.6359967648,104.9815785601,124.326595688,104.9815785601,123.1718951496,102.9815785601],
];
a hexagon has 6 vertexes. each subarray is a hexagon and has the x and y coordiantes of each vertex point.
so each sub-array contains 12 values.
Note: Not all hexagons have the same size!
structured like this (UNSORTED!): [x,y,x,y,x,y,x,y,x,y,x,y];
My problem now is: how can I sort the 2d array so that i have it ordered row-wise, going from top-left to bottom-right?

My idea was to just sum each sub value, but it doesn't give me the order that i want.
function sortHexagons(hexCoordinates) {
function sort(arr) {
const reducer = (accumulator, currentValue) => accumulator + currentValue;
return arr.reduce(reducer);
}
hexCoordinates.sort((a, b) => sort(a) - sort(b));
}