From 7b8c08c5d3c2f1e898daedf32dcd082c86de8852 Mon Sep 17 00:00:00 2001 From: Ravi Ranjan Date: Fri, 23 Oct 2020 20:55:09 +0530 Subject: [PATCH] again-_- --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index d787f06..77d7e7b 100644 --- a/README.md +++ b/README.md @@ -7,4 +7,4 @@ Important algorithms for coding interviews * Quick Sort TC = (Best Case = O(nlogn)), (Worst Case = O(n^2)) | SC = (Best Case = O(logn)), (Worst Case = O(n)) **2. Heaps** -* BuildingMaxHeap TC = O(nlogn) | SC = O(nlogn) +* BuildingMaxHeap TC = O(n) | SC = O(logn)