Michael Manga·Jan 31, 2021Hashing : probing methodsLet’s observe different methods to handle collisions in hash tables
Michael Manga·Jan 30, 2021Depth first searchDepth first search is a search algorithm , allowing to traverse trees or graphs.
Michael Manga·Jan 30, 2021Selection sortSlow algorithm. Indeed, important to notice that this algorithm has a worst time complexity as n^2, and that many other algorithms could be…