As well as Kruskal, how about a video on a kind of opposite of Kruskal, which is to keep deleting edges of greatest weight whilst keeping the graph connected. Not sure if this algorithm has a name attached to it, but it is appealing.
For this and other algorithms, it might be an idea to include some commentary (or even better, analysis) of the complexity of the worst-case scenario, because this seems to be in the syllabus. By considering complete graph Kn with n nodes, Kruskal and Prim both have O(n^3) complexity although it is interesting that Kruskal is half n^3 whereas Prim is one-sixth n^3. If an exam question were to ask, out of the blue, for an example of an algorithm with cubic complexity, it would be handy to be able to cite Kruskal or Prim from memory without having to figure it out in the exam room.
Please see response to your other comment regarding the intention of the videos, however I do agree that order complexity is useful to consider and I may do a video on that later. I tend to discuss complexity and order within lessons for my classes rather than attempting to cover it all in a video. I don't think that the exam board would ask for an example of an algorithm of a given order, but may ask for finding the order of a given algorithm. I may be wrong though and only time will tell as we get more past papers.... Thanks again for the suggestions.
Thank you! Do you have any other tips for the exam of things on the syllabus that I might have overlooked? I do realise that this comment is 3 years old and that my exam is tomorrow but you might see this in time... 😅
As well as Kruskal, how about a video on a kind of opposite of Kruskal, which is to keep deleting edges of greatest weight whilst keeping the graph connected. Not sure if this algorithm has a name attached to it, but it is appealing.
For this and other algorithms, it might be an idea to include some commentary (or even better, analysis) of the complexity of the worst-case scenario, because this seems to be in the syllabus. By considering complete graph Kn with n nodes, Kruskal and Prim both have O(n^3) complexity although it is interesting that Kruskal is half n^3 whereas Prim is one-sixth n^3. If an exam question were to ask, out of the blue, for an example of an algorithm with cubic complexity, it would be handy to be able to cite Kruskal or Prim from memory without having to figure it out in the exam room.
Please see response to your other comment regarding the intention of the videos, however I do agree that order complexity is useful to consider and I may do a video on that later. I tend to discuss complexity and order within lessons for my classes rather than attempting to cover it all in a video. I don't think that the exam board would ask for an example of an algorithm of a given order, but may ask for finding the order of a given algorithm. I may be wrong though and only time will tell as we get more past papers.... Thanks again for the suggestions.
Thank you! Do you have any other tips for the exam of things on the syllabus that I might have overlooked? I do realise that this comment is 3 years old and that my exam is tomorrow but you might see this in time... 😅