forked from TheAlgorithms/C
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
decimal to binary using recursion (TheAlgorithms#575)
* add decimal_to_binary_recursion.c * updating DIRECTORY.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
- Loading branch information
1 parent
ff2e7a3
commit f3bed0e
Showing
2 changed files
with
39 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,38 @@ | ||
/** | ||
* @file | ||
* @brief Convert decimal to binary using recursion algorithm | ||
*/ | ||
#include <assert.h> | ||
|
||
/** | ||
* Decimal to binary using recursion algorithm. | ||
* For example, if number = 5, the function returns the decimal integer 101. | ||
* @param number positive integer number to convert | ||
* @returns integer with digits representing binary value representation of | ||
* number. | ||
*/ | ||
int decimal_to_binary(unsigned int number) | ||
{ | ||
return number == 0 ? 0 : number % 2 + 10 * decimal_to_binary(number / 2); | ||
} | ||
|
||
/** Test function */ | ||
void test() | ||
{ | ||
const int sets[][2] = { | ||
{0, 0}, {1, 1}, {2, 10}, {3, 11}, {4, 100}, {6, 110}, {7, 111}, | ||
/* add more data sets to test */ | ||
}; | ||
|
||
for (int i = 0, size = sizeof(sets) / sizeof(sets[0]); i < size; ++i) | ||
{ | ||
assert(decimal_to_binary(sets[i][0]) == sets[i][1]); | ||
} | ||
} | ||
|
||
/** Driver Code */ | ||
int main() | ||
{ | ||
test(); | ||
return 0; | ||
} |