Skip to content

feat: add dutch national flag 3 way sort #941

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 12 commits into
base: master
Choose a base branch
from
Open

feat: add dutch national flag 3 way sort #941

Changes from 1 commit
Commits
Show all changes
12 commits
Select commit Hold shift + click to select a range
53d3fc1
feat: add dutch national flag sort
Data-Hero Feb 22, 2022
b8ff22e
test: add test for dnf_sort algorithm
Data-Hero Feb 22, 2022
a0e86e1
test: added test for dnf_sort and applied test
Data-Hero Feb 22, 2022
9f59081
Update dnf_sort.c
Data-Hero Feb 28, 2022
c23da7e
test: assert in dnf instead of print
Data-Hero Mar 2, 2022
4955910
fix: header descriptions
Data-Hero Mar 2, 2022
f57931c
fix: details in the comments
Data-Hero Mar 6, 2022
91af654
fix: merged details with include comment
Data-Hero Mar 6, 2022
1cc21d1
fix: run self test comment
Data-Hero Mar 6, 2022
8e716cd
Merge branch 'TheAlgorithms:master' into master
Data-Hero Mar 20, 2022
cf67df6
updating DIRECTORY.md
Mar 20, 2022
a0c2bfb
chore: add `\n`
Panquesito7 Sep 27, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update dnf_sort.c
  • Loading branch information
@Data-Hero
Data-Hero authored Feb 28, 2022
commit 9f590819cebfaeca4ec473c462cf76751cda3fcd
13 changes: 13 additions & 0 deletions sorting/dnf_sort.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,7 @@
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

/**
* @brief Dutch National Flag 3-Way inplace sort algorithm
Expand Down Expand Up @@ -71,6 +72,12 @@ static void test()
dnfSort(arr1, size);
printf("Sorted: \n");
printArray(arr1, size);

int8_t compare1[] = {0, 1, 1, 1, 1, 2};
for (int c = 0; c < size; c++)
{
assert(arr1[c] == compare1[c]);
}
free(arr1);

size = 1;
Expand All @@ -81,6 +88,12 @@ static void test()
dnfSort(arr2, size);
printf("Sorted: \n");
printArray(arr2, size);

int8_t compare2[] = {2};
for (int c = 0; c < size; c++)
{
assert(arr2[c] == compare2[c]);
}
free(arr2);
}

Expand Down