HTL-2IHIF-C/22-timed-sorting-2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Initial commit

Browse source
This commit is contained in:
github-classroom[bot] 2025-04-28 22:07:49 +00:00 • committed by GitHub
commit 607b5c2510
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
82 changed files with 8310 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

74
test_insertion_sort.c Normal file
View file

@ -0,0 +1,74 @@
/*----------------------------------------------------------
* HTBLA-Leonding / Klasse: n/a
* ---------------------------------------------------------
* Title: Implementation of UTs for insertion sort
* Author: S. Schraml
* ----------------------------------------------------------
* Description:
* Tests functions for insertion sort.
* ----------------------------------------------------------
*/
#include "test_insertion_sort.h"
#include <stdio.h>
#include <string.h>
#include "shortcut.h"
#include "config.h"
#include "sorting.h"
#include "insertion_sort.h"
/* ------------------------------------------------------------------- */
#ifdef LIST_VARIANT
TEST(test_insertion_sort_list_ascending) {
IntList list = list_obtain();
if (list != 0) {
init_list_random(list, 16);
insertion_sort_list(list, &is_in_asc_order);
int i = 1;
for (; i < list_get_size(list) && list_get_at(list, i-1) <= list_get_at(list, i); i++);
ASSERT_TRUE(i == list_get_size(list), MSG("Expected that all elements are in ascending order"));
list_release(&list);
}
}
TEST(test_insertion_sort_list_decending) {
IntList list = list_obtain();
if (list != 0) {
init_list_random(list, 16);
insertion_sort_list(list, &is_in_desc_order);
int i = 1;
for (; i < list_get_size(list) && list_get_at(list, i-1) >= list_get_at(list, i); i++);
ASSERT_TRUE(i == list_get_size(list), MSG("Expected that all elements are in descending order"));
list_release(&list);
}
}
#else
TEST(test_insertion_sort_array_ascending) {
int array[16];
int cnt = 16;
init_array_random(array, cnt);
insertion_sort_array(array, cnt, &is_in_asc_order);
int i = 1;
for (; i < cnt && array[i-1] <= array[i]; i++);
ASSERT_TRUE(i == cnt, MSG("Expected that all elements are in ascending order"));
}
TEST(test_insertion_sort_array_descending) {
int array[16];
int cnt = 16;
init_array_random(array, cnt);
insertion_sort_array(array, cnt, &is_in_desc_order);
int i = 1;
for (; i < cnt && array[i-1] >= array[i]; i++);
ASSERT_TRUE(i == cnt, MSG("Expected that all elements are in descending order"));
}
#endif