/* C program for insertion sort on a linked list */ #include<stdio.h> #include<stdlib.h> /* Link list node */ struct Node { int data; struct Node* next; }; // Function to insert a given node in a sorted linked list void sortedInsert(struct Node**, struct Node*); // function to sort a singly linked list using insertion sort void insertionSort(struct Node **head_ref) { // Initialize sorted linked list struct Node *sorted = NULL; // Traverse the given linked list and insert every // node to sorted struct Node *current = *head_ref; while (current != NULL) { // Store next for next iteration struct Node *next = current->next; // insert current in sorted linked list sortedInsert(&sorted, current); // Update current current = next; } // Update head_ref to point to sorted linked list *head_ref = sorted; } /* function to insert a new_node in a list. Note that this function expects a pointer to head_ref as this can modify the head of the input linked list (similar to push())*/ void sortedInsert(struct Node** head_ref, struct Node* new_node) { struct Node* current; /* Special case for the head end */ if (*head_ref == NULL || (*head_ref)->data >= new_node->data) { new_node->next = *head_ref; *head_ref = new_node; } else { /* Locate the node before the point of insertion */ current = *head_ref; while (current->next!=NULL && current->next->data < new_node->data) { current = current->next; } new_node->next = current->next; current->next = new_node; } } /* BELOW FUNCTIONS ARE JUST UTILITY TO TEST sortedInsert */ /* Function to print linked list */ void printList(struct Node *head) { struct Node *temp = head; while(temp != NULL) { printf("%d ", temp->data); temp = temp->next; } } /* A utility function to insert a node at the beginning of linked list */ void push(struct Node** head_ref, int new_data) { /* allocate node */ struct Node* new_node = malloc(sizeof(struct Node)) ; /* put in the data */ new_node->data = new_data; /* link the old list off the new node */ new_node->next = (*head_ref); /* move the head to point to the new node */ (*head_ref) = new_node; } // Driver program to test above functions int main() { struct Node *a = NULL; push(&a, 5); push(&a, 20); push(&a, 4); push(&a, 3); push(&a, 30); printf("Linked List before sorting \n"); printList(a); insertionSort(&a); printf("\nLinked List after sorting \n"); printList(a); return 0; }

The attachment includes a description of the assignment on the top, grading rubrik, and the class material on the bottom. All listed in the grading rubrik has to be met when writing the 5-6 page paper on how to handle application scaling.