第四周任务四扩展一（链表排序）

我不是女神ヾ 2022-06-13 01:57 159阅读 0赞

#include "iomanip" 
      
    #include <iostream>  
    
    using namespace std; 
    
    struct Salar  
    {  
    	double salary;
    	struct Salar *next;  
    };
    
    Salar *head = NULL, *p, *q;  
    class Salary
    {
    public:
    	void cin_salary();//得到工资
    	void cout_salary();//输出工资
    	Salar * arr(Salar *head);//结构体类型的指针
    private:
    	int num;
    };   
    
    int main()  
    {  
    	Salary s;
    
    	s.cin_salary();	
    	head = s.arr(head);
    	s.cout_salary();
    				
    	return 0;  
    }  
    void Salary::cin_salary()
    {
    	cout << "请输入职工人数：";
    	cin >> num;
    
        cout << "请输入职工工资：" << endl;
        for(int i = 0;i < num; i++)  
    	{  
    		p = new Salar;  
    		
    	    cin >> p-> salary;
    			
    		p-> next = NULL;  
    		if (i == 0)  
    			head = p;  
    		else  
    			q -> next = p;  
                q = p;  
    	} 
    }
    void Salary::cout_salary()
    {
    	int i = 0;
    	//输出所有的节点   
    	p = head;  
    	
    	while(p != NULL)  
    	{
    		
    		if (i % 8 == 0 && i != 0) cout << endl;
    		cout << p -> salary << '\t'; 
    		
    		p = p->next;
    		i++;
    	}
    	cout << endl;
    }
    Salar * Salary::arr(Salar *head)
    {
    	Salar *p,*p1,*p2,*p3,*temp;
    	p=head;
    
    	while(p->next != NULL) 
    	{
    		p = p->next;
    	}
    	while(p != head)
    	{
    		p3 = p1 = head;
    		p2 = p1->next;
    
    		while(p1 != p && p1 -> next != NULL)
    		{
    			if ((p1->salary) > (p2->salary))
    			{
    				if (p1 == head) 
    					head = p2;
    				else 
    					p3->next = p2;
    
    				temp = p2->next;
    				p2->next  = p1;
    				p1->next = temp;
    
    				temp = p1;
    				p1 = p2;
    				p2 = temp;
    			}
    			p3 = p1;
    			p1 = p1->next;
    			p2 = p1->next;
    		}
    		p = p3;
    	}
    	return head;
    }

![0_1331960984g606.gif][]  
多亏峰哥的相助，才做出这道题，好困难啊

[0_1331960984g606.gif]: /images/20220613/8842ace833264a8f9ef1214e702fcc55.png