Видео

Very well explained, thank you very much!

Thank you, I understood the subject through you.

Wow super explanation... after so much of wasting time on internet for this code explanation...i found this ❤

mermaid, baby!

video nice very thank

Simple explanation. Thank you!!!

Thank you for this very useful video!

So, if someone creates a program that is invasive to ones attention to the degree it is harassing with those with ADHD for example, it would be morally wrong to do so. Interesting....

thank you

Откуда вы родом?

how can I download ppt

Thank you for video. I have a piece of advice for interview situations related to MDE - make interviewers think about what you're saying and show your uniqueness. For example, when I meet interviewers who seem overly confident in their position, I often share a story: "When I'm bored," I tell them, "I ask programmers or students a simple question: Show me the Algorithm of the task you have programmed. They start showing me the computer program code. It's amusing, yet somewhat sad because the true algorithm or the client's business logic often gets lost in the program code. This makes it difficult to modify the algorithm or even for others to understand what the program does, what task was at hand, and what business logic of the client the program code implements." Depending on the interviewers' preparedness, this often leads to a serious discussion about the issue of the algorithm disappearing in coding and ways to solve this problem, such as applying known programming methodologies like Automaton Programming, v-agent oriented programming (VAOP), or model-driven engineering (mde). xstate, by the way, understanding the full scale of the problem, has done a lot in this direction and helps prevent the Algorithm from dissolving in the Program Code. I, Valeri Rakitine, discuss VAOP in more detail on my LinkedIn page or at vaop.notion.site/Articles-and-useful-resources-524bcff28774477aab091b82149307eb. It’s scary to even imagine how many resources of Planet Earth could be saved if the Algorithm did not disappear during coding, if programmers began to widely use such progressive programming methodologies as MDE and VAOP

Thanks 🙏🏻 mam

love the way you explain

Thanks 🤍

Very clear voice and explanation, thank you very much!

🤧 thenk cho

Thanks, short and sweet, very helpful!

This video is exactely I was looking for. Thank you!

bus event: the best replacement to frameworks on web-frontend development... HTMX implements it really well, in any case you don't wanna go with javascript vanilla.

great video! thank you.

I hope that you upload more videos.

Could you please reconsider Example 3 (4:00) and explain it in a bit more detail? In my opinion, Example 3 requires 2 tests for statement coverage and 4 tests for decision coverage (instead of the 2 DC tests you mentioned). This is because there are four different decision paths: YY, NN, YN, and NY. Please correct me if I haven't understood the concept of decision coverage correctly.

ties šitu video apsiverkiau

At 1 min 40 sec, the node 200 does not satisfy the successor definition. Wouldn't the node 180 be the predecessor of node 170?

Thank you

Nice explanation Thanks a lot ma'am

Thanks! Very nice video

Huge ! Thanks you ❤

Thank you.

Really greatful for this Asante sana

before even watching the video to the end i wanted to mention the clear net explanation you gave us about a topic that i spent maybe 2 month studying it in the unv nice choose of words and nice organisation keep up the good work

it is very useful summary about this topic. Thanks for all efort ✌

it is very helpful series for all students and employees. thank you so much for all details. Good job.

Great vedios sir, please make more vedios.. don't stop making vedios.

Nice explanation! Thank you <3

super

Thank you, just what I was looking for :-)

Amazing. Perfect explanation of the CLRS algorithm.

Thanks, great explanation :)

Thank you for this.

understood nothing from u

Great summary

Handsoff demo would be beter 😊

Awesome explanation! Wish I found you earlier! ❤️

Thanks for the video

just saved my night thank you <3

I found this material very usefule..to get a picture of where the AI alogs are headed..

w2tpe vyn.fyi

@3:47 can you please elaborate on how a doubly linked list can access the last element in constant time?