Bubble in link list
Download as DOCX, PDF0 likes374 views
This document provides code to sort a linked list in ascending order using bubble sort. It defines a Node class with data and pointer properties. It then prompts the user to enter nodes, stores them in a linked list, and displays the unsorted list. The code implements bubble sort to iterate through the list, compare adjacent nodes, and swap values if out of order. Finally, it displays the sorted linked list.
1 of 4
Download to read offline
More Related Content
What's hot (20)
Ad
Similar to Bubble in link list (20)
Ad
More from university of Gujrat, pakistan (20)
Recently uploaded (20)
Bubble in link list
- 1. Write a program that sort a link list in Ascending(Larger to Smaller) using bubble sort algorithm. #include<iostream> using namespace std; class node { public : int a; node *next; }; main() { char b; int count,i,j,k; i=j=k=0; count=1; node *head,*cur,*fur,*temp; head=NULL; while(1) { if(head==NULL) { fur=new node; cout<<"n Enter the data you want to store : ";
- 2. cin>>fur->a; fur->next=NULL; head=fur; cur=fur; } else { fur= new node; cout<<"n Enter the new data you want to store : "; cin>>fur->a; fur->next=NULL; cur->next=fur; cur=fur; } cout<<"n Enter f for add another node : "; cin>>b; if(b!='f') { cur->next=NULL; break; } count++; }
- 3. cout<<"n The Total nodes are : "<<count; cout<<"n The data before sorting are n"; cur=head; while(cur!=NULL) { cout<<" The data is : "<<cur->a<<endl; cur=cur->next; } cur=head; temp=cur; int s; while(cur!=NULL) { while(temp->next!=NULL) { if((temp->a )> (temp->next->a)) { s=temp->a; temp->a=temp->next->a; temp->next->a=s; } temp=temp->next; } temp=head;
- 4. cur=cur->next;} cout<<"nThe list is sorted n"; cout<<"n The data is shown on screenn"; cur=head; while(cur!=NULL) { cout<<" The data is : "<<cur->a<<endl; cur=cur->next; } system("pause"); }