diff --git a/client/src/pages/guide/english/algorithms/sorting-algorithms/index.md b/client/src/pages/guide/english/algorithms/sorting-algorithms/index.md
index 23f5a066df..fefa1a23f4 100644
--- a/client/src/pages/guide/english/algorithms/sorting-algorithms/index.md
+++ b/client/src/pages/guide/english/algorithms/sorting-algorithms/index.md
@@ -51,3 +51,5 @@ Sorting algorithms are said to be `in place` if they require a constant `O(1)` e
 ### Best possible time complexity for any comparison based sorting
 Any comparison based sorting algorithm must make at least nLog2n comparisons to sort the input array, and Heapsort and merge sort are asymptotically optimal comparison sorts.This can be easily proved by drawing the desicion tree diagram.
 
+### Algorithmic Paradigm
+Merge Sort and Quick Sort are based on Divide and Conquer Algorithm