Sorted linked list

Check out our Discord server: / discord

[@cryptoWorldever]

Your explanations are undoubtedly the best sir, thank you very much.

[@udarue]

very helpful!

[@user-vx8me1lu9h]

do you have a video about how to sort a linked list? Because in this video you have already sorted list, but what if you woudn`t?

[@CodeVault]

I will look into it

[@Miguel-mv5yc]

Once again, excellent content! Thank you for such a great effort, do you have a patreon I could make a contribution to?

[@CodeVault]

Not yet, but expect something like Patreon appearing soon on our website. For the time being we have the store, maybe you fancy buying something from there: code-vault.net/shop

[@ahmeta.112]

Hi sir, I wonder what kind of coupling is in this example? Is it ok to use a function within a function? Does it cause a regression effect? I'm just trying to understand.

[@CodeVault]

I'm not sure what you mean by regression effect. Can you elaborate on that?

[@jota1858]

you can call a function within a function but you cannot create a function within a function (like nested loops). Here we called a function(instert_beggining) inside insert_sorted that was already created, so not a nested function.

[@synacktra]

I still haven't watched this video yet, tried to do it myself: void sorted_insert(Node** root, int vl) { if((*root == NULL) || vl ch)){ //if root is null or value is lesser than or equal to roots' ch member, insert at beginning. beginsert(root, vl); return; } Node* current = *root; Node* aux; while(current->ch < vl && current->next != NULL) { // aux stores the previous node, thanks to your deallocating linked list memory video CodeVault :), // you're a great teacher, I am improving drastically :)) aux = current; current = current->next; } if(current->ch

[@CodeVault]

Looks perfectly fine. Good job!

[@zouzou6164]

Made my own modification: void insert_sorted(Node** head, int value) { // inserts a node to the list based on its numeric value Node* new_node = malloc(sizeof(Node)); if(new_node == NULL) exit(1); new_node->x = value; new_node->next = NULL; Node* curr = *head; if(*head == NULL) { *head = new_node; return; } while(curr->next != NULL) { if(curr->next->x >= new_node->x) { new_node->next = curr->next; curr->next = new_node; return; } curr = curr->next; } curr->next = new_node; free(new_node); } is this good?

[@CodeVault]

That free(new_node) will break your code. Do not free the memory you are adding to the linked list. Otherwise it looks good

[@pauloskalyvas1590]

hi...is this a good way to write it ? void insert_element_in_a_shorted_list(Node** root,int value){ if((*root==NULL) || ((*root)->x >= value) ){ insert_at_the_beginning(root, value); return; } Node* curr=*root; Node* temp=NULL; while(curr->x next; if(curr==NULL) break; } insert_after_a_specific_node(temp,value); }

[@CodeVault]

Yea, that looks good. Good job!