Trying LaTeX in Markdown

Author: UgurKap

README.md

@@ -7,8 +7,8 @@ This is a repo where I upload my implementations of various algorithms we examin
 These algorithm implementations can be found on sorts.h file.
 
 1. Insertion Sort  
-    An in-place sorting algorithms with worst case running time scenario O(n^2).
+    An in-place sorting algorithms with worst case running time scenario <img src="https://tex.s2cms.ru/svg/O(n%5E2)" />.
 2. Merge Sort  
-    An algorithm that uses divide and conquer. Its running time is Big Theta(nlgn)
+    An algorithm that uses divide and conquer. Its running time is <img src="https://tex.s2cms.ru/svg/%5CTheta(nlgn)" />
 3. Quick Sort  
-    Another sorting algorithm that uses divide and conquer method. Worst case running time O(n^2) but expected running time is O(nlgn).
+    Another sorting algorithm that uses divide and conquer method. Worst case running time <img src="https://tex.s2cms.ru/svg/O(n%5E2)" /> but expected running time is <img src="https://tex.s2cms.ru/svg/O(nlgn)"/>.