mirror of
https://github.com/theoludwig/programming-challenges.git
synced 2025-05-18 12:02:53 +02:00
feat(cli): add --all
option to run test
command
This commit is contained in:
@ -1,5 +1,5 @@
|
||||
#ifndef BUBBLE_SORT_H
|
||||
#define BUBBLE_SORT_H
|
||||
#ifndef __BUBBLE_SORT__
|
||||
#define __BUBBLE_SORT__
|
||||
|
||||
void swap_numbers(int *value_1, int *value_2);
|
||||
|
||||
|
@ -5,7 +5,7 @@
|
||||
|
||||
int main() {
|
||||
int current_number;
|
||||
int length = scanf("%d", ¤t_number);
|
||||
scanf("%d", ¤t_number);
|
||||
int *numbers = malloc(current_number * sizeof(int));
|
||||
int index_input = 0;
|
||||
while (scanf("%d", ¤t_number) != EOF) {
|
||||
|
@ -1,5 +1,5 @@
|
||||
#ifndef INSERTION_SORT_H
|
||||
#define INSERTION_SORT_H
|
||||
#ifndef __INSERTION_SORT__
|
||||
#define __INSERTION_SORT__
|
||||
|
||||
void insertion_sort(int *numbers, const int length);
|
||||
|
||||
|
@ -5,7 +5,7 @@
|
||||
|
||||
int main() {
|
||||
int current_number;
|
||||
int length = scanf("%d", ¤t_number);
|
||||
scanf("%d", ¤t_number);
|
||||
int *numbers = malloc(current_number * sizeof(int));
|
||||
int index_input = 0;
|
||||
while (scanf("%d", ¤t_number) != EOF) {
|
||||
|
@ -1,5 +1,5 @@
|
||||
#ifndef MERGE_SORT_H
|
||||
#define MERGE_SORT_H
|
||||
#ifndef __MERGE_SORT__
|
||||
#define __MERGE_SORT__
|
||||
|
||||
void merge(int numbers[], int left_index, int middle_index, int right_index);
|
||||
|
||||
|
@ -5,7 +5,7 @@
|
||||
|
||||
int main() {
|
||||
int current_number;
|
||||
int length = scanf("%d", ¤t_number);
|
||||
scanf("%d", ¤t_number);
|
||||
int *numbers = malloc(current_number * sizeof(int));
|
||||
int index_input = 0;
|
||||
while (scanf("%d", ¤t_number) != EOF) {
|
||||
|
Reference in New Issue
Block a user