Arrays 对数组进行排序并将其放入链接列表中
我有一个伪代码算法，它将未排序的数组作为输入，并将其排序到一个链表中。我不太明白它是怎么工作的。也许这里面有错误。我已经试了一个多小时来理解它是如何工作的，但我在某个点上被卡住了。我会尽可能多地解释。任何知道它是如何工作的人都乐意帮忙Arrays 对数组进行排序并将其放入链接列表中,arrays,algorithm,sorting,linked-list,Arrays,Algorithm,Sorting,Linked List,我有一个伪代码算法，它将未排序的数组作为输入，并将其排序到一个链表中。我不太明白它是怎么工作的。也许这里面有错误。我已经试了一个多小时来理解它是如何工作的，但我在某个点上被卡住了。我会尽可能多地解释。任何知道它是如何工作的人都乐意帮忙 ORDER(A) head [L1] = create(); //Null List is created. key[head[L1]] = A[1]; //First element of the array is put as the first
ORDER(A)
head [L1] = create(); //Null List is created.
key[head[L1]] = A[1]; //First element of the array is put as the first in list.
for i=2 to length(A);
x = create(); // create a node for every element of the array
key[x] = A[i]; // put A[i] as key in the node.
p1 = head[L1]; // make p1 head of the list.
if key[p1] > A[i]; //compare A[i] with the head
insert_head(x); // if smaller put it in the beggining and make it head
while key[next[p1]] < A[i] AND next[p1] =/= nil // This part I don't understand
if next[p1] == nil //very well.
next[p1] = x
next[x] = nil
else
next[x] = next[p1]
next[p1] = x;
// here we advance the position in the linked-list
// until we reach the end or the current element is smaller
while key[next[p1]] < A[i] AND next[p1] =/= nil
p1 = next[p1]
// if we reached the end, next[x] won't point to anything
if next[p1] == nil
next[p1] = x
next[x] = nil
// if we didn't reach the end,
// next[x] needs to point to anything what next[p1] was pointing to
else
next[x] = next[p1]
next[p1] = x;
//在这里，我们推进链接列表中的位置
//直到我们到达终点或者当前元素变小
而键[next[p1]]此方案的总复杂度为O（n logn）
对数组进行排序并将其放入链表中获取未排序的数组并将其放入已排序的链表中