// Buffer: Array [0..511] of int

// WRPointer: DINT

WRPointer:=DWORD_TO_DINT(DINT_TO_DWORD(WRPointer+1) AND 511); //
Buffer[WRPointer]:=AnaValue;

This is a circular buffer, new data overwrites old data.

//PointerTemp:DINT;

//iCount:DINT;

//Sorted: array[0..511] of int;

PointerTemp:=WRPointer;

iCount:=0;

while iCount<=511 do

Sorted[iCount]:=Buffer[PointerTemp];

PointerTemp:=DWORD_TO_DINT(DINT_TO_DWORD(PointerTemp-1) AND 511);

iCount:=iCount+1;

end_while;

This part of example copies circular buffer into a buffer named Sorted, that has the first element with newest data.

There is also a faster approach for sorting, with use of MOVE_BLK. You should copy elements from WRPointer to the end (511-th element) over first part of Sort[] with MOVE_BLK and then copy Buffer[] from 0-th el. to WRPointer-th element to the second part of Sort[] with MOVE_BLK.

MOVE_BLK is fast integrated function, instead copying arrays inSCL.