C Everything
This is a C repository containing a curated set of generic data structures and algorithm.
array.h
Go to the documentation of this file.
1 
5 #include "common.h"
6 
7 void bubble_sort(t_gen a, int n, t_dparams *op);
8 void selection_sort(t_gen a, int n, t_dparams *op);
9 void insertion_sort(t_gen a, int n, t_dparams *op);
10 void quick_sort(t_gen a, int n, t_dparams *op);
11 void merge_sort(t_gen a, int n, t_dparams *op);
insertion_sort
void insertion_sort(t_gen a, int n, t_dparams *op)
Insertion sort builds the final sorted array one item at a time. It has an O(n2) time complexity
Definition: array.c:67
quick_sort
void quick_sort(t_gen a, int n, t_dparams *op)
Quicksort is an in-place sorting algorithm is a divide and conquer algorithm which relies on a partit...
Definition: array.c:122
selection_sort
void selection_sort(t_gen a, int n, t_dparams *op)
Selection sort is an in-place comparison sorting algorithm. It has an O(n2) time complexity
Definition: array.c:40
merge_sort
void merge_sort(t_gen a, int n, t_dparams *op)
bubble_sort
void bubble_sort(t_gen a, int n, t_dparams *op)
Bubble sort is simplest sorting algorithm that works by repeatedly swapping the adjacent elements if ...
Definition: array.c:17
common.h
Top level include containg common headers.
data_params
data params struct defn
Definition: common.h:18
t_gen
void * t_gen
Base Data type used for all data structure and data elements.
Definition: typedefs.h:41