mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-22 05:21:49 +03:00
Code Issues Packages Projects Releases Wiki Activity

formatting source-code for b1d92cbdda

Browse Source
This commit is contained in:
github-actions 2020-06-20 11:28:26 +00:00
parent b1d92cbdda
commit 5347e6f87d
3 changed files with 231 additions and 174 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
conversions/c_atoi_str_to_integer.c
View File

@ -4,8 +4,8 @@
* \author [Mohammed YMIK](https://github.com/medymik)W * \author [Mohammed YMIK](https://github.com/medymik)W
* The function convert a string passed to an integer * The function convert a string passed to an integer
*/ */
#include <stdio.h>
#include <assert.h> #include <assert.h>
#include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
@ -63,7 +63,6 @@ int test_c_atoi()
printf("<<<< TEST DONE >>>>\n"); printf("<<<< TEST DONE >>>>\n");
} }
/** /**
* the main function take one argument of type char* * the main function take one argument of type char*
* example : ./program 123 * example : ./program 123

142
data_structures/binary_trees/threaded_binary_trees.c
View File

@ -23,7 +23,8 @@
/** /**
* Node, the basic data structure of the tree * Node, the basic data structure of the tree
**/ **/
typedef struct Node { typedef struct Node
{
int data; /**< stores the number */ int data; /**< stores the number */
struct Node *llink; /**< link to left child */ struct Node *llink; /**< link to left child */
struct Node *rlink; /**< link to right child */ struct Node *rlink; /**< link to right child */
@ -34,7 +35,8 @@ typedef struct Node {
* param[in] data value to be inserted * param[in] data value to be inserted
* \returns a pointer to the new node * \returns a pointer to the new node
**/ **/
node *create_node(int data) { node *create_node(int data)
{
node *ptr = (node *)malloc(sizeof(node)); node *ptr = (node *)malloc(sizeof(node));
ptr->rlink = ptr->llink = NULL; ptr->rlink = ptr->llink = NULL;
ptr->data = data; ptr->data = data;
@ -46,30 +48,43 @@ node *create_node(int data) {
* param[in,out] root pointer to node pointer to the topmost node of the tree * param[in,out] root pointer to node pointer to the topmost node of the tree
* param[in] data value to be inserted into the tree * param[in] data value to be inserted into the tree
*/ */
void insert_bt(node **root, int data) { void insert_bt(node **root, int data)
{
node *new_node = create_node(data); node *new_node = create_node(data);
node *temp; // to be deleted node *temp; // to be deleted
node *prev; // keeps track of the parent of the element deleted node *prev; // keeps track of the parent of the element deleted
if (*root == NULL) { if (*root == NULL)
{
*root = new_node; *root = new_node;
} else { }
else
{
temp = *root; temp = *root;
prev = NULL; prev = NULL;
while (temp != NULL) { while (temp != NULL)
if (new_node->data > temp->data) { {
if (new_node->data > temp->data)
{
prev = temp; prev = temp;
temp = temp->rlink; temp = temp->rlink;
} else if (new_node->data < temp->data) { }
else if (new_node->data < temp->data)
{
prev = temp; prev = temp;
temp = temp->llink; temp = temp->llink;
} else { }
else
{
return; return;
} }
} }
if (new_node->data > prev->data) { if (new_node->data > prev->data)
{
prev->rlink = new_node; prev->rlink = new_node;
} else { }
else
{
prev->llink = new_node; prev->llink = new_node;
} }
} }
@ -80,21 +95,30 @@ void insert_bt(node **root, int data) {
* \param[in] root node pointer to the topmost node of the tree * \param[in] root node pointer to the topmost node of the tree
* \param[in] ele value searched for * \param[in] ele value searched for
*/ */
void search(node *root, int ele) { void search(node *root, int ele)
{
node *temp = root; node *temp = root;
while (temp != NULL) { while (temp != NULL)
if (temp->data == ele) { {
if (temp->data == ele)
{
break; break;
} else if (ele > temp->data) { }
else if (ele > temp->data)
{
temp = temp->rlink; temp = temp->rlink;
} else { }
else
{
temp = temp->llink; temp = temp->llink;
} }
} }
if (temp == NULL) { if (temp == NULL)
{
printf("%s\n", "Element not found."); printf("%s\n", "Element not found.");
} else }
else
printf("%s\n", "Element found."); printf("%s\n", "Element found.");
} }
@ -102,8 +126,10 @@ void search(node *root, int ele) {
* performs inorder traversal * performs inorder traversal
* param[in] curr node pointer to the topmost node of the tree * param[in] curr node pointer to the topmost node of the tree
*/ */
void inorder_display(node *curr) { void inorder_display(node *curr)
if (curr != NULL) { {
if (curr != NULL)
{
inorder_display(curr->llink); inorder_display(curr->llink);
printf("%d\t", curr->data); printf("%d\t", curr->data);
inorder_display(curr->rlink); inorder_display(curr->rlink);
@ -114,8 +140,10 @@ void inorder_display(node *curr) {
* performs postorder traversal * performs postorder traversal
* param[in] curr node pointer to the topmost node of the tree * param[in] curr node pointer to the topmost node of the tree
*/ */
void postorder_display(node *curr) { void postorder_display(node *curr)
if (curr != NULL) { {
if (curr != NULL)
{
postorder_display(curr->llink); postorder_display(curr->llink);
postorder_display(curr->rlink); postorder_display(curr->rlink);
printf("%d\t", curr->data); printf("%d\t", curr->data);
@ -126,8 +154,10 @@ void postorder_display(node *curr) {
* performs preorder traversal * performs preorder traversal
* param[in] curr node pointer to the topmost node of the tree * param[in] curr node pointer to the topmost node of the tree
*/ */
void preorder_display(node *curr) { void preorder_display(node *curr)
if (curr != NULL) { {
if (curr != NULL)
{
printf("%d\t", curr->data); printf("%d\t", curr->data);
preorder_display(curr->llink); preorder_display(curr->llink);
preorder_display(curr->rlink); preorder_display(curr->rlink);
@ -140,22 +170,30 @@ void preorder_display(node *curr) {
* param[in,out] root pointer to node pointer to the topmost node of the tree * param[in,out] root pointer to node pointer to the topmost node of the tree
* param[in] ele value to be deleted from the tree * param[in] ele value to be deleted from the tree
*/ */
void delete_bt(node **root, int ele) { void delete_bt(node **root, int ele)
{
node *temp; node *temp;
node *prev; node *prev;
if (*root == NULL) if (*root == NULL)
return; return;
else { else
{
temp = *root; temp = *root;
prev = NULL; prev = NULL;
// search // search
while (temp != NULL) { while (temp != NULL)
if (temp->data == ele) { {
if (temp->data == ele)
{
break; break;
} else if (ele > temp->data) { }
else if (ele > temp->data)
{
prev = temp; prev = temp;
temp = temp->rlink; temp = temp->rlink;
} else { }
else
{
prev = temp; prev = temp;
temp = temp->llink; temp = temp->llink;
} }
@ -164,32 +202,47 @@ void delete_bt(node **root, int ele) {
if (temp == NULL) if (temp == NULL)
return; return;
else { else
{
node *replacement; // deleted node's replacement node *replacement; // deleted node's replacement
node *t; node *t;
if (temp->llink == NULL && temp->rlink == NULL) { if (temp->llink == NULL && temp->rlink == NULL)
{
replacement = NULL; replacement = NULL;
} else if (temp->llink == NULL && temp->rlink != NULL) { }
else if (temp->llink == NULL && temp->rlink != NULL)
{
replacement = temp->rlink; replacement = temp->rlink;
} else if (temp->llink != NULL && temp->rlink == NULL) { }
else if (temp->llink != NULL && temp->rlink == NULL)
{
replacement = temp->llink; replacement = temp->llink;
} else { }
else
{
replacement = temp->rlink; // replaced with inorder successor replacement = temp->rlink; // replaced with inorder successor
t = replacement; t = replacement;
while (t->llink != NULL) { while (t->llink != NULL)
{
t = t->llink; t = t->llink;
} }
t->llink = temp->llink; // leftmost node of the replacement is linked to t->llink =
temp->llink; // leftmost node of the replacement is linked to
// the left child of the deleted node // the left child of the deleted node
} }
if (temp == *root) { if (temp == *root)
{
free(*root); free(*root);
*root = replacement; *root = replacement;
} else if (prev->llink == temp) { }
else if (prev->llink == temp)
{
free(prev->llink); free(prev->llink);
prev->llink = replacement; prev->llink = replacement;
} else if (prev->rlink == temp) { }
else if (prev->rlink == temp)
{
free(prev->rlink); free(prev->rlink);
prev->rlink = replacement; prev->rlink = replacement;
} }
@ -199,11 +252,13 @@ void delete_bt(node **root, int ele) {
/** /**
* main function * main function
*/ */
int main() { int main()
{
printf("BINARY THREADED TREE: \n"); printf("BINARY THREADED TREE: \n");
node *root = NULL; node *root = NULL;
int choice, n; int choice, n;
do { do
{
printf("%s\n", "1. Insert into BT"); printf("%s\n", "1. Insert into BT");
printf("%s\n", "2. Print BT - inorder"); printf("%s\n", "2. Print BT - inorder");
printf("%s\n", "3. Print BT - preorder"); printf("%s\n", "3. Print BT - preorder");
@ -213,7 +268,8 @@ int main() {
printf("%s\n", "Type 0 to exit"); printf("%s\n", "Type 0 to exit");
scanf("%d", &choice); scanf("%d", &choice);
switch (choice) { switch (choice)
{
case 1: case 1:
printf("%s\n", "Enter a no:"); printf("%s\n", "Enter a no:");
scanf("%d", &n); scanf("%d", &n);

6
machine_learning/kohonen_som_trace.c
View File

@ -21,11 +21,13 @@
#endif #endif
#ifndef max #ifndef max
#define max(a, b) (((a) > (b)) ? (a) : (b)) /**< shorthand for maximum value \ #define max(a, b) \
(((a) > (b)) ? (a) : (b)) /**< shorthand for maximum value \
*/ */
#endif #endif
#ifndef min #ifndef min
#define min(a, b) (((a) < (b)) ? (a) : (b)) /**< shorthand for minimum value \ #define min(a, b) \
(((a) < (b)) ? (a) : (b)) /**< shorthand for minimum value \
*/ */
#endif #endif