在 C++ 中对链表进行排序

问题描述

我对无限循环很生气，您认为什么是合适的解决方案?

I'm getting mad with infinite loop, what do you think is suitable solution?

void sorting () {
  node * temphead = head;
  node * tempnode = NULL;

  for (int i=0; i<count; i++) {
    for (int j=0; j<count-i; j++) {
      if (temphead->data > temphead->next->data) {
        tempnode = temphead;
        temphead = temphead->next;
        temphead->next = tempnode;
      }

      temphead=temphead->next;
      count++;
    }
  }
}

我试图增加计数并在 for 循环之前和之后使用许多条件和 while- 没有结果

I tried to increment count and use many conditions with while- before and after the for loop with no result

推荐答案

更简单的滑过链表的方法是这样的:

An easier way to slide through a linked list is like this:

for (node *current = head; current != nullptr; current = current->next) {
    // This will run through all of the nodes until we reach the end.
}

并滑动到倒数第二个项目(确保 node->next 存在)如下所示:

And to slide to the second to last item (ensuring that node->next exists) looks like this:

for (node *current = head; current->next != nullptr; current = current->next) {
    // Go through all of the nodes that have a 'next' node.
}

如果你想计算链表中有多少项，你可以这样做:

If you want to count how many items are in a linked list, you do something like this:

int count = 0;
for (node *current = head; current != nullptr; current = current->next) {
    count = count + 1;
}

所以像上面这样的选择类型排序看起来像这样:

So a selection type sort like you have above would look like this:

for (node *index = head; index->next != nullptr; index = index->next) {
  for (node *selection = index->next; selection != nullptr; selection = selection->next) {
    if (index->data > selection->data) {
      swap(index->data, selection->data);
    }
  }
}

尽管排序链表通常不是最好的方法(除非您正在执行合并).

Although sorting linked lists is generally not the best way to go (unless you're performing a merge).

这篇关于在 C++ 中对链表进行排序的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持跟版网！