#include "array.h"
int* create_tab(int tab[], unsigned tab_size) {
- tab = malloc(sizeof(int) * tab_size);
+ tab = (int*)malloc(sizeof(int) * tab_size);
if (tab != NULL) {
/* initialize to zero the integer array */
for (unsigned i = 0; i < tab_size; i++) {
}
void free_tab(int tab[]) {
- free(tab);
+ if (!tab)
+ free(tab);
}
/* we suppose both tabs are already created */
/* FIXME: I think it's worth doing some sanity checks on the array size:
* dest_tab_size >= src_tab_size */
if (src_tab == NULL || dest_tab == NULL) {
- printf("please ensure you have created both arrays beforehand\n");
+ printf("Please ensure you have created both arrays beforehand\n");
return;
}
for (unsigned i = 0; i < src_tab_size; i++) {
}
int* resize_tab(int tab[], unsigned old_tab_size, unsigned new_tab_size) {
- tab = realloc(tab, sizeof(int) * new_tab_size);
+ tab = (int*)realloc(tab, sizeof(int) * new_tab_size);
+ /* zero by default the added cells */
if (old_tab_size < new_tab_size) {
for (unsigned i = old_tab_size; i < new_tab_size; i++) {
tab[i] = 0;
return el_count;
}
-unsigned count_tab_criteria(int tab[], unsigned tab_size, count_criteria_cb c_criteria) {
+unsigned count_tab_criteria(int tab[], unsigned tab_size, c_criteria_cb c_criteria) {
unsigned cr_count = 0;
for (unsigned i = 0; i < tab_size; i++) {
return cr_count;
}
-bool is_even(int a) {
- return (a % 2 == 0);
-}
-
-bool is_odd(int a) {
- return (a % 2 != 0);
-
-}
-
-void sort_tab(int tab[], unsigned tab_size, criteria_cb criteria) {
- sort_bubble_array(tab, tab_size, criteria);
+void sort_tab(int tab[], unsigned tab_size, s_criteria_cb sort_criteria) {
+ sort_bubble_array(tab, tab_size, sort_criteria);
}