my fisrt idea is is sort arry function hase anther input which is a (incresing or decrising) and i dont see the realtion this with other thread some time i have a big about 10000 elemnets array of big structure about 2K each structure when i sortrit and reverse the result ,
x bytes of data size of array , anther x size of sorted array and finlay anther x size of reverse array that mean LabVIEW in this case used 3 times size of array
Please read the thread linked to previously. Reverse Array is an in-place operation which creates no copies. I think sort is also an in-place operationmeaning it creates no copies.
Of course if you program so that YOU are making copies of the arrays than it might be problematic but AFAIK the LabVIEW primitives are fine as they are.