Home / Sortings

Sortings

What is Breadth First Search (BFS)

Breadth First Search

Breadth First Search is an algorithm for traversing elements from a data structure or searching tree.  Visiting each vertex and edge exactly in a well defined order is done in Graph travelers. Traversal of an element in graphically is well defined in searching algorithms. The first traversal in BFS accomplished …

Read More »

Merge Sort

Merge Sort is a sorting technique based on divide and conquer technique with comparison. Conceptually, a merge sort works as follows : i) Divide the unsorted list into n sublists, each containing 1 element (a list of 1 element is considered sorted). ii) Repeatedly merge sublists to produce new sublists …

Read More »