Fix pointers formatting style

array.c

@@ -6,18 +6,18 @@
 #include <stdlib.h>
 #include <time.h>
 
-void swap(int32_t* a, int32_t* b) {
+void swap(int32_t *a, int32_t *b) {
     int32_t tmp = *a;
     *a = *b;
     *b = tmp;
 }
 
-int32_t* create_array(uint32_t array_length) {
-    int32_t* array = malloc(array_length * sizeof(int32_t));
+int32_t *create_array(uint32_t array_length) {
+    int32_t *array = malloc(array_length * sizeof(int32_t));
     return array;
 }
 
-void init_array(int32_t* array, uint32_t array_length) {
+void init_array(int32_t *array, uint32_t array_length) {
     for (uint32_t i = 0; i < array_length; i += 1) {
         array[i] = i;
     }
@@ -25,7 +25,7 @@ void init_array(int32_t* array, uint32_t array_length) {
     permute_array_randomly(array, array_length);
 }
 
-void display_array(int32_t* array, uint32_t array_length) {
+void display_array(int32_t *array, uint32_t array_length) {
     printf("{");
 
     for (uint32_t i = 0; i < array_length; i += 1) {
@@ -38,7 +38,7 @@ void display_array(int32_t* array, uint32_t array_length) {
     printf("}\n");
 }
 
-void permute_array_randomly(int32_t* array, uint32_t array_length) {
+void permute_array_randomly(int32_t *array, uint32_t array_length) {
     for (uint32_t i = 0; i < array_length; i += 1) {
         uint32_t index_1 = rand() % (int32_t)array_length;
         uint32_t index_2 = rand() % (int32_t)array_length;
@@ -46,8 +46,8 @@ void permute_array_randomly(int32_t* array, uint32_t array_length) {
     }
 }
 
-void permute_array_cyclic(int32_t* array, uint32_t array_length, uint32_t n) {
-    int32_t* tmp = (int32_t*)malloc(sizeof(array[0]) * array_length);
+void permute_array_cyclic(int32_t *array, uint32_t array_length, uint32_t n) {
+    int32_t *tmp = (int32_t *)malloc(sizeof(array[0]) * array_length);
 
     for (uint32_t i = 0; i < array_length; i += 1) {
         tmp[(i + n) % array_length] = array[i];
@@ -60,7 +60,7 @@ void permute_array_cyclic(int32_t* array, uint32_t array_length, uint32_t n) {
     free(tmp);
 }
 
-uint32_t find_lowest_value_index(int32_t* array, uint32_t array_length) {
+uint32_t find_lowest_value_index(int32_t *array, uint32_t array_length) {
     uint32_t lowest_index = 0;
 
     for (uint32_t i = 1; i < array_length; i += 1) {
@@ -72,14 +72,14 @@ uint32_t find_lowest_value_index(int32_t* array, uint32_t array_length) {
     return lowest_index;
 }
 
-void place_lowest_value_last(int32_t* array, uint32_t array_length) {
+void place_lowest_value_last(int32_t *array, uint32_t array_length) {
     uint32_t lowest_index = find_lowest_value_index(array, array_length);
     int32_t tmp = array[array_length - 1];
     array[array_length - 1] = array[lowest_index];
     array[lowest_index] = tmp;
 }
 
-void insertion_sort_desc(int32_t* array, uint32_t array_length) {
+void insertion_sort_desc(int32_t *array, uint32_t array_length) {
     uint32_t i = 1;
 
     while (i < array_length) {
@@ -96,7 +96,7 @@ void insertion_sort_desc(int32_t* array, uint32_t array_length) {
     }
 }
 
-uint32_t count_elements_lower_than(int32_t* array, uint32_t array_length, uint32_t n) {
+uint32_t count_elements_lower_than(int32_t *array, uint32_t array_length, uint32_t n) {
     uint32_t count = 0;
 
     for (uint32_t i = 0; i < array_length; i += 1) {
@@ -108,8 +108,8 @@ uint32_t count_elements_lower_than(int32_t* array, uint32_t array_length, uint32
     return count;
 }
 
-int32_t* sum(int32_t* operand_1, int32_t* operand_2, uint32_t array_length) {
-    int32_t* result = create_array(array_length);
+int32_t *sum(int32_t *operand_1, int32_t *operand_2, uint32_t array_length) {
+    int32_t *result = create_array(array_length);
 
     for (uint32_t i = 0; i < array_length; i += 1) {
         result[i] = operand_1[i] + operand_2[i];
@@ -118,14 +118,14 @@ int32_t* sum(int32_t* operand_1, int32_t* operand_2, uint32_t array_length) {
     return result;
 }
 
-void multiply_by_n(int32_t* array, uint32_t array_length, uint32_t n) {
+void multiply_by_n(int32_t *array, uint32_t array_length, uint32_t n) {
     for (uint32_t i = 0; i < array_length; i += 1) {
         array[i] *= n;
     }
 }
 
-double* convert_int32_t_array_to_double(int32_t* array, uint32_t array_length) {
-    double* result = malloc(array_length * sizeof(double));
+double *convert_int32_t_array_to_double(int32_t *array, uint32_t array_length) {
+    double *result = malloc(array_length * sizeof(double));
 
     for (uint32_t i = 0; i < array_length; i += 1) {
         result[i] = (double)array[i];

array.h

@@ -3,16 +3,16 @@
 
 #include <stdint.h>
 
-int32_t* create_array(uint32_t array_length);
-void init_array(int32_t* array, uint32_t array_length);
+int32_t *create_array(uint32_t array_length);
+void init_array(int32_t *array, uint32_t array_length);
 void display_array(int32_t *array, uint32_t array_length);
-void permute_array_randomly(int32_t* array, uint32_t array_length);
-void permute_array_cyclic(int32_t* array, uint32_t array_length, uint32_t n);
-void place_lowest_value_last(int32_t* array, uint32_t array_length);
-void insertion_sort_desc(int32_t* array, uint32_t array_length);
-uint32_t count_elements_lower_than(int32_t* array, uint32_t array_length, uint32_t n);
-int32_t* sum(int32_t* operand_1, int32_t* operand_2, uint32_t array_length);
-void multiply_by_n(int32_t* array, uint32_t array_length, uint32_t n);
-double* convert_int32_t_array_to_double(int32_t* array, uint32_t array_length);
+void permute_array_randomly(int32_t *array, uint32_t array_length);
+void permute_array_cyclic(int32_t *array, uint32_t array_length, uint32_t n);
+void place_lowest_value_last(int32_t *array, uint32_t array_length);
+void insertion_sort_desc(int32_t *array, uint32_t array_length);
+uint32_t count_elements_lower_than(int32_t *array, uint32_t array_length, uint32_t n);
+int32_t *sum(int32_t *operand_1, int32_t *operand_2, uint32_t array_length);
+void multiply_by_n(int32_t *array, uint32_t array_length, uint32_t n);
+double *convert_int32_t_array_to_double(int32_t *array, uint32_t array_length);
 
 #endif