<p>在我的小项目中,我已经按降序排列了一个列表,但是,我的目标是按照这个自定义模式对它进行排序。(最大->;最小->;次大->;次小->;)等</p>
<p>在爪哇,我可以这样做:</p>
<pre><code>public static void wackySort(int[] nums) {
//first, this simply sorts the array by ascending order.
int sign = 0;
int temp = 0;
int temp2 = 0;
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums.length -1; j++){
if (nums[j] > nums[j+1]) {
temp = nums[j];
nums[j] = nums[j+1];
nums[j+1] = temp;
}
}
}
//prepare for new array to actually do the wacky sort.
System.out.println();
int firstPointer = 0;
int secondPointer = nums.length -1;
int[] newarray = new int[nums.length];
int size = nums.length;
//increment by two taking second slot replacing the last (n-1) term
for (int i = 0; i < nums.length -1; i+=2) {
newarray[i] = nums[firstPointer++];
newarray[i+1] = nums[secondPointer--];
}
//store those values back in the nums array
for (int i = 0; i < nums.length; i++) {
nums[i] = newarray[i];
}
}
</code></pre>
<p>我的目标是在python中做同样的事情,除了向后。关于如何将执行古怪排序的最后一个for循环转换为python并使其倒退,有什么想法吗?在</p>