How to sort linked list using sorthing method.pptx

Linked list
• Linked lists are a type of linear data structure. They consist of nodes
containing the data and a reference (link) needed to move on to the
next item.
Node
The head pointer contains the address of the first node. Null means the end of the linked list.
head
100 200 500
Linked lists can be of multiple types: singly, doubly, and circular linked list
100
12 200 14 500 67 NULL
Data Next

Creating a single node of a single linked list
in c
• #include <stdio.h>
• #include<stdlib.h>
• struct node
• {
• int data;
• struct node* next;
• };
• int main()
• {
• struct node *head= NULL;
• head = (struct node*)malloc(sizeof(struct
node));
• head->data= 45;
• head->next=NULL;
• printf("%d", head->data);
• return 0;
• }
Creating a single node of a single linked
list in c++
• #include<iostream>
• using namespace std;
• struct node
• {
• int data;
• node* next;
• };
• int main()
• {
• node *head= NULL;
• head = new node();
• head->data= 45;
• cout<< head->data;
• return 0;
• }

Creating a single linked list in c
• struct node
• {
• int data;
• struct node* next;
• };
• int main()
• {
• struct node *head= NULL;
• head = (struct node*)malloc(sizeof(struct node));
• head->data= 45;
• printf("%dn", head->data);
• struct node *second= NULL;
• second = (struct node*)malloc(sizeof(struct node));
• second->data= 98;
• second->next=NULL;
• head->next=second;
• printf("%d", second->data);
• return 0;
• }
Creating a single linked list in c++
• struct node
• {
• int data;
• node* next;
• };
• int main()
• {
• node *head= NULL;
• head->data= 45;
• cout<< head->data<<endl;
• node *second= NULL;
• second = new node();
• head->next= second;
• cout<< second->data;
• return 0;
• }

Single Linked List
• struct node {
• int data;
• node* next; };
• int main()
• { node *head= NULL;
• head->data= 45;
• cout<< head->next<<endl;
•
• cout<< head->next<<endl;
• node*third =NULL;
• third= new node();
• third->data= 198;
• third->next=NULL;
• second->next= third;
• cout<< second->next<<endl;
•
• //Traversing of linked list
• while (head != NULL) {
• cout << head->data<<endl;
• head = head->next;
• }
• return 0; }

Algorithm for Traversing of linked list
Traversing means to process each node exactly once.
• Step 1: [INITIALIZE] SET PTR = HEAD
• Step 2: Repeat Steps 3 and 4 while PTR != NULL
• Step 3: Apply process to PTR -> DATA
• Step 4: SET PTR = PTR->NEXT
• [END OF LOOP]
• Step 5: EXIT

Second method (not moving a head pointer)
Creating a single linked list in c
• struct node {
• int data;
• struct node* next; };
• int main()
• { struct node *head= NULL;
• head = (struct node*)malloc(sizeof(struct node));
• head->data= 45;
• printf("%dn", head->data);
• struct node *second= NULL;
• head->next=second;
• printf("%dn", second->data);
• head->next->next=second;
• printf("%d", second->data);
• return 0; }
Creating a single linked list in c++
• struct node {
• int data;
• node* next; };
• int main()
• head->data= 45;
• cout<< head->data<<endl;
• cout<< second->data<<endl;
• head->next->next= second;
• cout<< second->data;
• return 0; }

ALGORITHM OF OFINSERTION NODE AT THE BEGINNING LINKED LIST
Lets START is the pointer having the initial position in linked list.
Let data be the element to be inserted in the new node.
POS is the mark where the new node is to be inserted.
TEMP is a temporary pointer to hold the node address.
1. Input data
2. Develop a New Node
3. New Node → DATA = data
4. New Node → Next = NULL
5. If (START equal to NULL)
then START = New Node.

Inserting the node at the BEGINNING of Single Linked List
• struct node {
• int data;
• node* next; };
• void insertion(node**head,int ND) //double pointer
• {
• node *newnode= NULL;
• newnode = new node();
• newnode->data= ND;
• newnode-> next = *head; //Link address part
• *head= newnode; //Make newNode as first node
• }
• int main()
• head->data= 15;
•
• node*third =NULL;
•
• insertion(&head,1); //call by value
• }
• return 0; }

Inserting the node at a CERTAIN position (or after node)of Single Linked List
• struct node {
• int data;
• node* next; };
• void insertatcertain(node*head,int ND,int p)
• {
• node *nn= head;
• node *newnode= NULL;
• newnode = new node();
• newnode->data = ND;
• p--;
• while(p!=1)
• {
• nn=nn->next;
• p--;
• }
• newnode->next = nn->next;
• nn->next = newnode;
• }
• int main()
• head->data= 45;
• node*third =NULL ;
• int p;
• cout<<"at which position u want to add node = ";
• cin>>p;
• insertatcertain(head,100,p);
• }
• return 0; }

Algorithm to Inserting the node at the END of Single Linked List
Begin
1. Input DATA
2. develop a New Node
3. New Node → DATA = DATA
4. New Node → Next = NULL
5. If (START equal to NULL)
(a) START = New Node
6. Else
(a) TEMP = START
(b) While (TEMP → Next not equal to NULL)
(i) TEMP = TEMP → Next
7. TEMP → Next = New Node
Exit

Inserting the node at the END of Single Linked List
• #include <iostream>
• struct node
• {
• int data;
• node*next; };
• void insertatend(node*temp,int val)
• {
• node*end= NULL;
• end= new node();
• end->data = val;
• end->next=NULL;
• while(temp->next != NULL) {
• temp = temp->next;
• }
• temp->next = end;
• }
• int main()
• {
• node*head= NULL;
• head= new node();
• head->data = 12;
• head->next =NULL;
•
• node*one = NULL;
• one= new node();
• one->data = 13;
• one->next =NULL;
• head->next =one;
• node*two = NULL;
• two= new node();
• two->data = 14;
• two->next =NULL;
• one->next =two;
• node*three = NULL;
• three= new node();
• three->data = 15;
• three->next =NULL;
• two->next =three;
• insertatend(head,99);
• while(head!=NULL)
• {
• cout<<head->data<<endl;
• }
• return 0;
• }

Algorithm to Deleting a node from the beginning
• Step 1: IF HEAD = NULL
• Write UNDERFLOW
• Go to Step 5
• else
• Step 2: SET PTR = HEAD
• Step 3: SET HEAD = HEAD -> NEXT
• Step 4: delete PTR
• Step 5: EXIT

Deleting a node from the beginning
• struct node
• {
• int data;
• node*next;
• };
• void del(node**head)
• {
• if (*head==NULL)
• { cout<<"list is empty";
• }
• else
• { node*temp=*head;
• *head=(*head)->next;
• delete temp;
• } }
• int main()
• { node*head= NULL;
• one->data = 13;
• two->data = 14;
• one->next =two;
• del(&head);
• { cout<<head->data<<endl;
• head = head->next; }
• return 0; }

Algorithm to Deleting a node from the end
• IF HEAD = NULL
• Write UNDERFLOW
• Go to Step 8
• else
• Step 3: Repeat Steps 4 and 5
• while PTR -> NEXT != NULL
• Step 4: SET PREPTR = PTR
• Step 5: SET PTR = PTR -> NEXT
• [END OF while LOOP]
• Step 6: SET PREPTR -> NEXT = NULL
• Step 7: delete PTR
• Step 8: EXIT

Deleting a node from the END
• struct node
• {
• int data;
• node*next;
• };
• void del(node**head)
• { if (*head==NULL)
• { cout<<"list is empty";
• }
• else if ((*head)->next==NULL)
• { delete head;
• *head=NULL;
• }
• else
• { node*temp=*head;
• node*pnode=NULL;
• while(temp->next!=NULL)
• { pnode=temp;
• temp=temp->next;
• }
• pnode->next=NULL;
• delete temp; } }
• int main()
• one->data = 13;
• two->data = 14;
• one->next =two;
• del(&head);
• return 0; }

Algorithm to Deletion after a given node in Linked List
• Step 1: IF HEAD = NULL
• Write UNDERFLOW
• Go to Step 10
• else
• Step 4: Repeat Steps 5 and 6
• while PREPTR -> DATA != NUM
• Step 6: SET PTR = PTR -> NEXT
• [END OF while LOOP]
• Step 7: SET TEMP = PTR
• Step 8: SET PREPTR -> NEXT = PTR -> NEXT
• Step 9: delete TEMP
• Step 10 : EXIT

Deletion after a given node in Linked List
• struct node
• {
• int data;
• node*next;
• };
• void delafter(node**head)
• {
• node*temp=(*head)->next;
• (*head)->next = temp->next;
• delete temp;
• }
• int main()
• one->data = 13;
• two->data = 14;
• one->next =two;
• delafter(&head);
• return 0; }

Searching an element in Linked List
• struct node
• {
• int data;
• node*next;
• };
• void search(node*head, int val )
• { while(head!=NULL) {
• if(head->data == val) {
• cout << "element found"<<endl;
• return; }
• cout << "No"<<endl;
• }
• int main()
• {
• node*head= NULL;
• one->data = 13;
• two->data = 14;
• one->next =two;
• search(head,56);
• return 0; }

How to sort linked list using sorthing method.pptx

More Related Content

Similar to How to sort linked list using sorthing method.pptx (20)

Recently uploaded (20)

How to sort linked list using sorthing method.pptx