4 ms·
Full support to Huffman coding and RSA. Last year I learnt Ford Fukkerson [0] and Dijkstra [1] Algorithm. Algorithns for graphs are really interesting and have
by aaossa 10y ago
Full support to Huffman coding and RSA.
Last year I learnt Ford Fukkerson [0] and Dijkstra [1] Algorithm. Algorithns for graphs are really interesting and have a lot of applications. Fun fact, I learnt these in a transport engineering course, not in a computer science one, and I still use them sometimes in computer science courses.
[0] https://en.m.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm https://en.m.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algor...
[1] https://en.m.wikipedia.org/wiki/Dijkstra%27s_algorithm https://en.m.wikipedia.org/wiki/Dijkstra%27s_algorithm