AMORTIZED ANALYSIS WITH EXAMPLE || AMORTIZED TIME COMPLEXITY || DAA

[@MartinBwambale-yn4le]

Thank you so much, I have watched many videos but this is the best

[@CharmingMoments09]

Thank you so much Sir your videos are really helpful Sir.

[@dr.padmajapulicherla5545]

wonderful explanation.Thank you sir

[@uma-5719]

Thank you sir 🙏🏻👌🏻

[@HarishNidamaneni]

Sir, can you please explain why we have to double the array size if the elements are full?

[@sanjivkumar2462]

enjoyed the session

[@patrickemerysevor7410]

Sir please can you explain this: perform a theoritical analysis on the algorithm below and state the complexity functionand asymtotic compleity #include void swap(int &a, int &b){ int temp = a; a = b: b = temp; } void Sort(int arr[], int n){ for (int i = 0; i < n - i - 1; ++j){ for (int j = 0; j < n - i - 1; ++j){ // compare adjacent elementa if (arr[j] > arr[j + 1]){ // Swap if they are in the wrong order swap(arr[j] > arr[j + 1]); } } } void printArray(int arr[], int size){ for (int i = 0; i < size; i ++){ std:: cout

[@sampathm4253]

thank u sir

[@jaya10128]

Hi sir