sort.h

#ifndef _SORT_H_
#define _SORT_H_

#include <stdio.h>
#include <stdlib.h>

/*	STRUCTURES DEFINITION	*/

/**
 * struct listint_s - Doubly linked list node
 *
 * @n: Integer stored in the node
 * @prev: Pointer to the previous element of the list
 * @next: Pointer to the next element of the list
 */
typedef struct listint_s
{
	const int n;
	struct listint_s *prev;
	struct listint_s *next;
}	listint_t;






/*	STRUCTURES FOR LAST ADVANCED TASK (deck_sort) */







/*	FUNCTION PROTOTYPES	*/

void print_array(const int *array, size_t size);
void print_list(const listint_t *list);

void bubble_sort(int *array, size_t size);
void insertion_sort_list(listint_t **list);
void selection_sort(int *array, size_t size);
void quick_sort(int *array, size_t size);
void shell_sort(int *array, size_t size);
void cocktail_sort_list(listint_t **list);
void counting_sort(int *array, size_t size);
void merge_sort(int *array, size_t size);
void heap_sort(int *array, size_t size);
void radix_sort(int *array, size_t size);
void bitonic_sort(int *array, size_t size);
void quick_sort_hoare(int *array, size_t size);



/* My helper functions */
void swap_nodes(listint_t **, listint_t *, listint_t *);
void recursive_call(int *array, size_t size, int low, int high);
int partition(int *array, size_t size, int low, int high);
void faviswap(int *, int *);
void sift_down(int *array, size_t size, size_t index, size_t size2);
void bitonic_sort_rec(int *array, size_t size, int dir, size_t size_total);
void bitonic_merge(int *array, size_t size, int dir, size_t size_total);
void merge_sort_rec(int *array, size_t size, int *temp);
void merge(int *array, size_t size, size_t mid, int *tmp);



#endif /* _SORT_H_ */