Question

I need help with encoding a doubly-linked list, which must include a function that sorts the name field in the bubble method, it must be encoded in the c language.

Answer 1

The program for sorting the double linked list with the bubble method is given below,

#include <stdio.h>   
struct ddnode{
int num;
struct ddnode *prev;
struct ddnode *next;
};
struct ddnode *head, *tail = NULL;   
//insertNode() will add a ddnode to the list
void insertNode(int num) {
//Create a new ddnode
struct ddnode *newDnode = (struct ddnode*)malloc(sizeof(struct ddnode));
newDnode->num = num;

if(head == NULL) {
//Both head and tail will point to newDnode
head = tail = newDnode;
//head's prev will point to NULL
head->prev = NULL;
//tail's next will point to NULL, as it is the last ddnode of the list
tail->next = NULL;
}
else {
//newDnode will be added after tail such that tail's next will point to newDnode
tail->next = newDnode;
//newDnode's prev will point to tail
newDnode->prev = tail;
//newDnode will become new tail
tail = newDnode;
//As it is last ddnode, tail's next will point to NULL
tail->next = NULL;
}
}

//sortDoubleLinkedList() will sort the given list in ascending order
void sortDoubleLinkedList() {
struct ddnode *curr = NULL, *index = NULL;
int temp;
//Check whether list is empty
if(head == NULL) {
return;
}
else {
//Current will point to head
for(curr = head; curr->next != NULL; curr = curr->next) {
//Index will point to ddnode next to curr
for(index = curr->next; index != NULL; index = index->next) {
//If curr's num is greater than index's num, swap the num of curr and index
if(curr->num > index->num) {
temp = curr->num;
curr->num = index->num;
index->num = temp;
}
}
}
}
}

//printList() will print out the nodes of the list
void printList() {
//Node curr will point to head
struct ddnode *curr = head;
if(head == NULL) {
printf("List is empty\n");
return;
}
while(curr != NULL) {
//Prints each ddnode by incrementing pointer.
printf("%d ",curr->num);
curr = curr->next;
}
printf("\n");
}

int main() {
//adding the nodes in thr list
insertNode(4);
insertNode(3);
insertNode(9);
insertNode(1);
insertNode(2);
   insertNode(8);
// original list
printf("Original list: \n");
printList();
//Sorting operation
sortDoubleLinkedList();
// sorted list
printf("Sorted list: \n");
printList();
return 0;
}

SCREENSHOT

#include <stdio.h> struct ddinode int num; struct ddnode prev; struct ddnode *next; : struct ddinode "head, "tail - NULL; //insertNode() will add a ddnode to the List void insertNode(int num) { //Create a new ddnode struct ddnode *new node - (struct ddnodenalloc(sizeof(struct ddnode)); new node->nun - num; if(head = NULL) { //Both head and tail will point to new node head-tail - new node; //head's prev will point to NULL head->prev - NULL; //toil's next will point to NULL, as it is the last ddnode of the List tail->next - NULL; else { //new node will be added after tail such that tail's next will point to new node tail->next = new node; //new node's prey will point to tail new node-prev - tail; //new node will become new tail tail - new node; //As it is Last donode, tail's next will point to NULL tail->next - NULL; // sortDoublelinkedlist() will sort the given List in ascending order void sortDoublcLinkedList() { struct ddnode *curr - NULL, "index - NULL; int terp: //Check whether list is empty if(head -- NULL) { return; else { //Current will point to head for(curr - head; curr->next 1 - NULL; curr - curr->next) { //Index will point to donode next to curr for(index - curr->next; index I NULL; index - index->next) { //If curr's nun is greater than index's num, swap the num of curr and index

//If curr's nu is greater than index's num, swap the nun of curr and index if (curr- num > index>num) { temp - curr num; curr-num - index->num; index->num - tempi //printList() will print out the nodes of the List void printList() { // Node curr will point to head struct ddnode *curr - head; if(head -- NULL) { printf("List is empty\n"); return; while(curr !- NULL) { // Prints cach ddnade by incrementing pointer. printf("%d",curr->num); curr - curr->next; printf("\n"); int main() { //adding the nodes in the List insert Node (4): insert Node(3): insertNode(9) insertNode(1): insertNode(2); insertNode(): // original List printf("Original list: \n"); printList(): //Sorting operation sortDoublelinkedList(); // sorted List printf("Sorted list: \n"); printList : return 0;

o stdout Original list: 714 52 Sorted list: 1 24 5 7