Saturday, December 5, 2020

Why time complexity of Heapify is O(n)?

 Look at this first  then you may Have a look here also.

Harmonic progression this is needed to understand the above. 

at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Machine Learning certification course

A certification course in ML by Code Basics  

  • IT Full Forms
    Acronym Full Form AJAX Asynchronous JavaScript and XML API Application Programming Interface APK Android Application Package ASP Activ...
  • C program : To check whether M is an exact multiple of N
    #include<stdio.h> int main() {      int M,N,q;   scanf("%i %i",&M, &N);   if((M%N)!=0)   {printf("0...
  • Interview Tips
    "A good company understands that problem solving ability and the ability to learn new things are far more important than knowledge o...