francesco/myclib
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

feat(vector): quicksort

Browse Source
This commit is contained in:
Francesco
2025-09-10 02:47:35 +02:00
parent b2f7510d64
commit 9c037c5e25
3 changed files with 31 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
test/vector/v1.c
View File

@@ -15,12 +15,20 @@ static void multiply(size_t index, void *elem) {
e->age = e->age * 2;
}
/* Another way to use foreach
/* Another way to use foreach */
static void print(size_t index, void *elem) {
my_elem_s *e = (my_elem_s *)elem;
printf("%s (%d)\n", e->name, e->age);
}
*/
/* Compare function used to sort */
int my_cmp(const void *a, const void *b) {
/* Sort by age */
my_elem_s *ma = (my_elem_s *)a;
my_elem_s *mb = (my_elem_s *)b;
return ma->age - mb->age;
}
void test_v1() {
/* Allocate a new vector */
@@ -47,7 +55,9 @@ void test_v1() {
/* Insert an element */
vec_push(v, &e1);
e1.age = 25;
vec_push(v, &e1);
e1.age = 19;
vec_insert(v, 2, &e1);
my_elem_s last = {
.age = 33,
@@ -60,7 +70,13 @@ void test_v1() {
/* Iterate for each element */
vec_foreach(v, multiply);
/* Print each element */
// vec_foreach(v, print);
puts("Before sort:");
vec_foreach(v, print);
/* Sort */
vec_sort(v, my_cmp);
puts("After sort:");
vec_foreach(v, print);
/* Deallocate the vector */
vec_free(v);