The list of methods to do Zigzag Encode are organized into topic(s).
byte[]
zigzagEncode(byte[] data) zigzag Encode
byte[] result = new byte[64];
for (int i = 0; i < naturalOrder.length; i++) {
result[i] = data[naturalOrder[i]];
return result;
int
zigZagEncode(int i) Same as #zigZagEncode(long) but on integers.
return (i >> 31) ^ (i << 1);
long
zigZagEncode(long n) Zig-zag encode: this helps transforming small signed numbers into small positive numbers.
return (n >> 63) ^ (n << 1);
int[]
zigZagSort(int[] array) Sort an array in zig-zag pattern i.e.
for (int i = 1; i < array.length; i++) {
if ((i % 2 == 1 && array[i] < array[i - 1]) || (i % 2 == 0 && array[i] > array[i - 1])) {
int temp = array[i];
array[i] = array[i - 1];
array[i - 1] = temp;
return array;
...