Sorting System Alogirthm

So... I am actually done. I don't know how to do this one. At all. I did tried to create a sorting system, but only managed to create such with use of entities (which is HYPER bad for performance). Anyone... can just take the time and suggest at least one good alternative? Context: I need to sort the data by the integer value in Storages. So, for example, it looks like this on the input: data merge storage ceevyte:tmp {quicksort:{main:{output:[], s_list:[], b_list:[], _list:[], list:[ {value:67,data:{test:8}}, {value:88,data:{test:9}}, {value:-88,data:{test:1}}, {value:1016,data:{test:10}}, {value:19,data:{test:6}}, {value:1,data:{test:4}}, {value:-45,data:{test:2}}, {value:11,data:{test:5}}, {value:0,data:{test:3}}, {value:34,data:{test:7}} ]}}} And on the output, it should look like this: data merge storage ceevyte:tmp {quicksort:{main:{output:[], s_list:[], b_list:[], _list:[], list:[ {value:-88,data:{test:1}}, {value:-45,data:{test:2}}, {value:0,data:{test:3}}, {value:1,data:{test:4}}, {value:11,data:{test:5}}, {value:19,data:{test:6}}, {value:34,data:{test:7}}, {value:67,data:{test:8}}, {value:88,data:{test:9}}, {value:1016,data:{test:10}} ]}}} And I dont know how to do this. Just... please. I need help. Sorting is the BASE of everything tied up to pathfinding and... everything. I need to know how to implement this monstrocity.