Algorithms_in_C  1.0.0
Set of algorithms implemented in C.
list.h
1 #ifndef __LIST__
2 #define __LIST__
3 
4 #define L List_T
5 typedef struct L *L;
6 
7 struct L
8 {
9  void *val;
10  L next;
11 };
12 
13 extern L List_init(void);
14 extern L List_push(L list, void *val);
15 extern int List_length(L list);
16 extern void **List_toArray(L list);
17 extern L List_append(L list, L tail);
18 extern L List_list(L list, void *val, ...);
19 /* TODO */
20 extern L List_copy(L list);
21 extern int List_pop(L *list);
22 
23 #undef L
24 #endif
L
Definition: list.h:8
data
Definition: prime_factoriziation.c:25
node
Node, the basic data structure in the tree.
Definition: binary_search_tree.c:15
node::data
int data
data of the node
Definition: binary_search_tree.c:18
Node::data
int data
stores the number
Definition: threaded_binary_trees.c:28
Node
Node, the basic data structure of the tree.
Definition: threaded_binary_trees.c:27
min_heap
Definition: min_heap.c:5
queue
Definition: bfs.c:6
merge
void merge(int *a, int l, int r, int n)
Perform merge of segments.
Definition: merge_sort.c:33
main
int main()
Driver code.
Definition: client.c:70
max_heap
Definition: max_heap.c:5
min
#define min(a, b)
shorthand for minimum value
Definition: kohonen_som_topology.c:43
display
void display(double **A, int N)
Function to display square matrix.
Definition: lu_decompose.c:66
insert
node * insert(node *root, int data)
Insertion procedure, which inserts the input key in a new node in the tree.
Definition: binary_search_tree.c:46