Implement the quicksort algorithm on lists. You write one function
struct listnode * sort(struct listnode * a);
with
struct listnode { struct listnode * next; int key;};
It takes a list, and returns the list in sorted sequence. You change only pointers, do not allocate new nodes or move key values to diļ¬erent nodes. The programming language is C or C++; test your code before submission using the gcc or g++ compiler.
Question
Solution Preview
These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.
#include <stdio.h>#include <stdlib.h>
struct listnode { struct listnode * next; int key;};
struct listnode * sort(struct listnode * a);
int length(struct listnode * head){
int len = 0;
struct listnode *tmp = head;
while(tmp != NULL){
tmp = tmp->next;
len++;
}
return len;
}
struct listnode* getNode(int value){
struct listnode* node = (struct listnode*) malloc(sizeof(struct listnode));
node->key = value;
node->next = NULL;
return node;
}...
By purchasing this solution you'll be able to access the following files:
Solution.c.
Return to homework library