队列插入排序 [英] Queue insertion sort

问题描述

有人可以帮助我更改此插入排序以正常工作吗？队列实现在头文件中。

Can someone help me to change this insertion sort to work properly? Queue implementation is in the header file.

#include <iostream>
#include "queue.h"
using namespace std;

void queue::Enqueue(int m_data)
{

        node * temp=new node;
        temp->value=m_data;
        temp->next=NULL;
        if(front==NULL && tail==NULL)
        {
            front=tail=temp;
            return;
        }
        else
        {
            tail->next=temp;
            tail=temp;
        }

}

void queue::dequeue(){
    node *temp=front;
    if(front==NULL)
    {
        cout<<"queue is empty"<<endl;
        return;
    }
    if(front==tail)
    {
        front=tail=NULL;
    }
    else
    {
        front=front->next;

    }
    free(temp);

}

int queue::frontt()
{
    if(front==NULL)
    {
        cout<<"queue is empty"<<endl;
    }
    return front->value;
}
void queue::print() {

    node *temp = front;
    while (temp != NULL) {
        cout << temp->value;
        temp = temp->next;
    }
    cout << endl;
}

void queue::insertion_sort()
{

    int temp=front->value;

    while(front->next!=NULL)
    {
        while(front->value>front->next->value && front!=NULL)
        {
            swap(front->value, front->next->value);
        }

    }
}
int main()
{
    queue q;
    q.Enqueue(7);
    q.Enqueue(1);
    q.Enqueue(4);
    q.Enqueue(5);
    q.Enqueue(2);
    q.Enqueue(0);
    q.Enqueue(8);

    q.print();
    cout<<endl;
    q.insertion_sort();
    cout<<endl;
    q.print();

}

我的尝试：



我试图使用基于数组的实现作为帮助器，但它有很多不同。

What I have tried:

I have tried to use array based implementation as a helper but it is a lot different.

推荐答案

要么 insertion_sort 正在排序队列中的前2个元素并无限循环，你的排序算法对我来说太聪明了。

我认为insert_sort的完全重写是按顺序。

我想是时候学习如何调试代码了。



有一个工具可以让你看到什么你的代码正在做，它的名字是调试器。它也是一个很好的学习工具，因为它向你展示了现实，你可以看到哪种期望与现实相符。

当你不明白你的代码在做什么或为什么它做它做的时候，答案就是答案是调试器。

使用调试器查看代码正在执行的操作。只需设置断点并查看代码执行情况，调试器允许您逐行执行第1行并在执行时检查变量。



调试器 - 维基百科，免费的百科全书 [ ^ ]



掌握Visual Studio 2010中的调试 - 初学者指南 [ ^ ]

使用Visual Studio 2010进行基本调试 - YouTube [ ^ ]

调试器在这里向您展示您的代码正在做什么，您的任务是与什么进行比较应该这样做。

调试器中没有魔法，它没有找到错误，它只是帮助你。当代码没有达到预期的效果时，你就会接近一个错误。

Either the insertion_sort is sorting the first 2 elements in the queue and loop infinitely, either your sort algorithm is too smart for me.
I think a complete rewrite of insertion_sort is in order.
I guess it is time to learn how to debug your code.

There is a tool that allow you to see what your code is doing, its name is debugger. It is also a great learning tool because it show you reality and you can see which expectation match reality.
When you don't understand what your code is doing or why it does what it does, the answer is debugger.
Use the debugger to see what your code is doing. Just set a breakpoint and see your code performing, the debugger allow you to execute lines 1 by 1 and to inspect variables as it execute.

Debugger - Wikipedia, the free encyclopedia[^]

Mastering Debugging in Visual Studio 2010 - A Beginner's Guide[^]
Basic Debugging with Visual Studio 2010 - YouTube[^]
The debugger is here to show you what your code is doing and your task is to compare with what it should do.
There is no magic in the debugger, it don't find bugs, it just help you to. When the code don't do what is expected, you are close to a bug.

这篇关于队列插入排序的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！