OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

use Cantor variable name and not contour

Browse Source
This commit is contained in:
Krishna Vedala 2020-06-30 13:52:43 -04:00
parent c755eefcd0
commit cc45bea17d
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
misc/cantor_set.c
View File

@ -8,28 +8,28 @@
#include <string.h> #include <string.h>
/** structure to define Cantor set */ /** structure to define Cantor set */
typedef struct contour typedef struct _cantor_set
{ {
double start; /**< start of interval */ double start; /**< start of interval */
double end; /**< end of interval */ double end; /**< end of interval */
struct contour *next; /**< pointer to next set */ struct _cantor_set *next; /**< pointer to next set */
} Contour; } CantorSet;
/** Iterative constructor of all sets in the current level. This function /** Iterative constructor of all sets in the current level. This function
* dynamically allocates memory when creating new sets. These are freed by the * dynamically allocates memory when creating new sets. These are freed by the
* function ::free_memory. * function ::free_memory.
* @param head pointer to interval set instance to update * @param head pointer to interval set instance to update
*/ */
void propagate(Contour *head) void propagate(CantorSet *head)
{ {
// if input is NULL, ignore the process // if input is NULL, ignore the process
if (head == NULL) if (head == NULL)
return; return;
Contour *temp = head; // local pointer to track propagation CantorSet *temp = head; // local pointer to track propagation
// create new node for the new set // create new node for the new set
Contour *newNode = (Contour *)malloc(sizeof(Contour)); CantorSet *newNode = (CantorSet *)malloc(sizeof(CantorSet));
// get 1/3rd of interval // get 1/3rd of interval
double diff = (((temp->end) - (temp->start)) / 3); double diff = (((temp->end) - (temp->start)) / 3);
@ -52,9 +52,9 @@ void propagate(Contour *head)
/** Print sets in the current range to `stdout` /** Print sets in the current range to `stdout`
* @param head pointer to first set in the current level * @param head pointer to first set in the current level
*/ */
void print(Contour *head) void print(CantorSet *head)
{ {
Contour *temp = head; CantorSet *temp = head;
while (temp != NULL) // print while a valid set is found while (temp != NULL) // print while a valid set is found
{ {
printf("\t"); printf("\t");
@ -69,7 +69,7 @@ void print(Contour *head)
/** Clear memory allocated by ::propagate function. /** Clear memory allocated by ::propagate function.
* @param head pointer to first allocated instance. * @param head pointer to first allocated instance.
*/ */
void free_memory(Contour *head) void free_memory(CantorSet *head)
{ {
if (!head) if (!head)
return; return;
@ -103,7 +103,7 @@ int main(int argc, char const *argv[])
return -1; return -1;
} }
Contour head = {.start = start_num, .end = end_num, .next = NULL}; CantorSet head = {.start = start_num, .end = end_num, .next = NULL};
// loop to propagate each level from top to bottom // loop to propagate each level from top to bottom
for (int i = 0; i < levels; i++) for (int i = 0; i < levels; i++)