Implement in C, using linked lists the Quicksort algorithm. Write a main() function that reads in a list, calls your function and prints out a sorted list as a result. You can assume that the list only contains integers. Paste as a comment the run of your code on 3 examples at the end of the file.
Question
Solution Preview
This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.
#include <stdio.h>#include <stdlib.h>
#include <time.h>
struct node{
int data;
struct node * next;
struct node * previous;
};
typedef struct node node;
struct list{
node * head;
node * tail;
int size;
};
typedef struct list list;
node * NewNode(int d);
list * NewList();
void AddNode(list * l, int d);
void Left(list * left, list * l, int t);
void Right(list * right, list * l, int t);
void FreeList(list * l);
void CopyList(list * l1,list * l2);
void quicksort(list * l);
void Display(list * l);
int main(int argc, char** argv) {
int i,j ;
list * l;...
Return to homework library