theoludwig/programming-challenges
1
1
Fork 0
mirror of https://github.com/theoludwig/programming-challenges.git synced 2025-05-18 12:02:53 +02:00
Code Issues Releases Activity

feat(solutions): add sorting-algorithms/dart/bubble-sort

Browse Source
This commit is contained in:
Divlo
2021-06-29 22:38:17 +02:00
parent aa3eec06ba
commit 50a1cda3d8
18 changed files with 62 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
challenges/sorting-algorithms/solutions/c/bubble-sort/solution.c
View File

@ -4,8 +4,9 @@
#include "bubble_sort.h"
int main() {
int *numbers = malloc(25000 * sizeof(int));
int current_number;
int length = scanf("%d", &current_number);
int *numbers = malloc(current_number * sizeof(int));
int index_input = 0;
while (scanf("%d", &current_number) != EOF) {
numbers[index_input] = current_number;

3
challenges/sorting-algorithms/solutions/c/insertion-sort/solution.c
View File

@ -4,8 +4,9 @@
#include "insertion_sort.h"
int main() {
int *numbers = malloc(25000 * sizeof(int));
int current_number;
int length = scanf("%d", &current_number);
int *numbers = malloc(current_number * sizeof(int));
int index_input = 0;
while (scanf("%d", &current_number) != EOF) {
numbers[index_input] = current_number;

3
challenges/sorting-algorithms/solutions/c/merge-sort/solution.c
View File

@ -4,8 +4,9 @@
#include "merge_sort.h"
int main() {
int *numbers = malloc(25000 * sizeof(int));
int current_number;
int length = scanf("%d", &current_number);
int *numbers = malloc(current_number * sizeof(int));
int index_input = 0;
while (scanf("%d", &current_number) != EOF) {
numbers[index_input] = current_number;