Implementation of segment tree in ADA (#177)

added quick sort in python3 (#176)

Added Lowest common ancestor in BST (#175)

Create shell_sort.h (#174)

quick sort using C (#173)

merge sort code in python3 (#172)

Create QuickSort.py (#171)

added an efficient median search algorithm (#170)

The BFS Algorithm in C++ and Python is added to the Graph Folder (#169)

Added min_heap.cpp (#168)

created binary (#166)

Create all_operations_of_Doubly_ll.cpp (#165)

Create Circular_ll.cpp (#164)

Create Bogo_sort.cpp (#163)

Create Quick_sort.cpp (#162)