You have a real talent for explaining algorithms the simplest way possible. Many tutors dwelve into pseudocode, data structures, etc. which are not necessary for understanding the problem and the solution scheme. I think the main problem of those tutors is that they don't realize the difference between the tools necessary to implement an algorithm and the way of solving a problem itself.
What do you think about explaining the problem and the solution in a simple way THEN diving into (pseudo)code and data structures, is it a good method?
Very nice explanation. As a novice, I am wondering are those greedy and DSatur algorithms superior to the backtracking algorithms for graph coloring? Also, the backtracking algorithm is not very clear to me, especially the pseudocode.
Hi, The backtracking algorithm would be better in general because it can be set up to generalise the DSatur algorithm. I.e. make a solution via DSatur, and then try to improve the solution further if you can, Cheers Rhyd
you put the title in english and you speak english thank you sire, i saw. a video the title was written in french and the guy was speaking arabic of course i reported him
