TestRightArray
来源:互联网 发布:文本加密软件 编辑:程序博客网 时间:2024/05/20 01:10
public class LeftRightArray
{
public static void p(Object o)
{
System.out.println(o);
}
void sort(int input[], int len, int output[])
{
// sort.
int temp = 0;
for (int i = 0; i < len - 1; i++)
{
for (int j = i; j < len; j++)
{
if (input[j] > input[i])
{
temp = input[j];
input[j] = input[i];
input[i] = temp;
}
}
}
// store into output.
int left = len / 2 - 1;
int right = len / 2;
for (int k = 0; k < len; k++)
{
if (k % 2 == 0)
output[right++] = input[k];
else
output[left--] = input[k];
}
}
public static void main(String[] args)
{
int input1[] = {3,6,1,9,7};
int output[] = new int[input1.length];
LeftRightArray m = new LeftRightArray();
m.sort(input1,5,output);
for (int i = 0; i < output.length; i++)
{
System.out.println(output[i]);
}
}
}
{
public static void p(Object o)
{
System.out.println(o);
}
void sort(int input[], int len, int output[])
{
// sort.
int temp = 0;
for (int i = 0; i < len - 1; i++)
{
for (int j = i; j < len; j++)
{
if (input[j] > input[i])
{
temp = input[j];
input[j] = input[i];
input[i] = temp;
}
}
}
// store into output.
int left = len / 2 - 1;
int right = len / 2;
for (int k = 0; k < len; k++)
{
if (k % 2 == 0)
output[right++] = input[k];
else
output[left--] = input[k];
}
}
public static void main(String[] args)
{
int input1[] = {3,6,1,9,7};
int output[] = new int[input1.length];
LeftRightArray m = new LeftRightArray();
m.sort(input1,5,output);
for (int i = 0; i < output.length; i++)
{
System.out.println(output[i]);
}
}
}
0 0