Відео

@@othmaneer-refaly9216 thank you for your kindness ♥️

@@AyoubCluster haha love this

@@thuggonaut The algo have some worst cases that can go up to 6700 moves for 500 numbers, i'm trying to make optimizations

Hey friend! I explain target_nodes in the animation @10:20 Hope it helps 😊

Hello! I hope this reply isn't too late! You know how the host bits are the contiguous 1s, right, so the top row CIDRs will have those 1s in both 3rd and 4th (9 bits min). Whereas the second row CIDRS will only have those 1s in the 4th (8 bits max). I hope that helps? Good luck friend! You got this!

@@fabocas you're welcome friend, and good luck! 😊

@@thuggonaut trying.. to not be blackholed😭😂

@@eray3147 hello, I havnt completed minishell yet but it's in the works 😊

I appreciate you! I hope you've been well 😊

I'm glad, and you're welcome 😊😊 Of course! I used Microsoft Powerpoint for the slides, and then windows capture to record the screen. I didn't need to compile things together because I just screen recorded the whole thing. If you have windows though, microsoft clipchamp is good for video editing, hope that helps!

I am not sure, but I think that if you used something bigger than 192 instead of 66 I think you could have used the /18 mask

And I just noticed that what I said wouldn't work because the gluon network is set to use the 192+ range

Thanks so much bro!

Thank you so much for the kind words 💛💛

@@arturcarvalho7484 you are so welcome and thank you for the kind words! Good luck with your project! 😊

It technically cost one more but because it is the case of every numbers it is voluntary ignored

@@corentinlt7859 Ok, thank you!

Hello friend, thank you for passing by, and your kindness. I believe it does. There may be the occasional case where it returns higher instructions, but I suggest running the case a few times (also recommended in the evals), and it should give you the desired average.

Did you have any luck? I'll try to get back to you as soon as I can! The black hole is creepin on me 😅

Right back at you 🥰

@@thuggonaut which campus you're studying on it

@@adamekhobba2156 I'm at 42 Adelaide. What about you?

@@thuggonaut 1337 if you know it. it's 42 school in Morocco

Thank you for your kindness! I'm so glad it can be helpful for you. All the best with aceing it😊

@@thuggonaut thanks!! 🥰

Such a fair question! The bools were added as an option to print the commands, or not, which can be useful for debugging purposes. In hindsight though, going back to the scattered bools to change its value is tedious, and I wasn't experienced with global variables or custom macros. I'd use custom macros instead, something like '#define ENABLE_PRINT 1' in the .h file

Thank you for your kind words 😊

Thank you so much friend, I appreciate you 😊

have you solved it?

@@Myxoceph Yes, I was able to solve it

@@yasuofedeer9851 how? Can you help me too?

Hello! Thank you for visiting, and for this feedback, my program is definitely flawed! I'm glad you solved the issue, please share how so if you've the time 😊

@@Myxoceph you should free argv if it was dynamically allocated (what's returned from split)

yes, but since index starts in 0 you get ra twice ;)

Hello, thanks for visiting! We need to do it twice because the algorithm requires us to push the first two nodes to stack [b] (if [a] has >4 nodes), but only push the first node if [a] has 4 nodes.

Hi, sorry for the late reply! No, we only need to make sure [b] node is pushed on to the correct [a] node, so we move it (the [a] node) to the top before doing so @16:42

Hello, thank you for dropping by! At that state of configuration, the push cost for 7 is 3 because we need to rr twice in stack a: 1st rr to bring 42 to top, 2nd rr to bring 7 to top. Let me know if I've missed something or if I've understood your question incorrectly and we'll try again, good luck friend! 😊

@@thuggonaut ok now i understand but why we do not use only rotate in this case, so we make two moves till with 1 move we rotate both and with the other only a and we have 7 and 0 at the top. I make this think because i tried to fallow a logic on my code (not tested yet) where i add 1 to the median. Anyway thank you for your help and sorry for my english.

Thank you! Cheers!

Feen cv kh or bg or med hhhh

Amazing work, yay!

Hello, thanks for your feedback 🙏 I didn't test for memory leaks but knew that could be the case, what you've written. I chose the easiest route possible to get the project done and didn't want to worry about it too much as long as it worked, and so I created a different split() to ft_split(). split() is only responsible for splitting a string, and returns NULL at any point where malloc is unsuccessful. init_stack_a() is responsible for appending nodes if there are no errors. If there are errors the stack is freed. Thanks again and good luck!

was you able to solve that matter? cause i have been spending hours working on that part to prevent the leak but i solved half of it only! if you did please share it and thanks in advance

@@Ay_140 you have to free the result of ft_split if used (it should be used only if you have one argument) if your variable is **splited_str, then you free(splited_str[0]) and then free(splited_str[1]) until splited_str[i] is NULL, and then you free(splited_str)

@@RiDOU-p2g i have done this but im still getting one block of memory not freed, searched everywhere but couldn’t fix it 😓 When i fix it it affects the behavior of the full function. If you did it right share your git hub solution if you don’t mind 🙏🏻

@@Ay_140 I'm sorry you had to do this as my code has flaws! Someone else opened an issue in my GitHub regarding this, I'm wondering if that will shed any helpful light as well. Please do let me know how you go to solve it 🙏🏼 Also thanks @user-vh6rl1se8e for highlighting the leak and solution 😊

Hi! Thanks for visiting :) B2BR is tedious, but I liked that I didn't have to "think" much with it haha. Always great to have a go at it first, for sure. You could even watch the first half which explains visually how the swap/push operations and linked lists work, then have a go at coding it. Even if your chosen sort algorithm is different to mine, it can be transferrable. Good luck with 42!

Haha 😊 I hope it was helpful. See you around!

Thank you for the kindness 😊

Hello! I'm not up to minishell yet, but will definitely consider it once I am.

Hello 😊 I won't be able to anytime soon, but I found this video super helpful m.ua-cam.com/video/-Mt2FdJjVno/v-deo.html or check out my guide on the GitHub link that scored me 125%

@@thuggonautthanks!

Thank you friend!

Thank you friend! That makes me happy 😊

Thank you for your kind words and feedback. It makes my heart so glad you found it helpful 😊

Thank you! 😊

Thanks so much friend! You helped me massively with get_next_line (despite it not being English) and I linked your video in my github for it. I didn't know how to reach out to you, but I am so grateful for you!

⁠@@thuggonautThank you so much for the kind words, I’m really happy the GNL video helped !

Thank you forever!

I so appreciate you!