Compare Data Types, Data Structures, Abstract Data Types | Cat Can Code

preview_player
Показать описание
👨‍💻 I Compare Data Types, Data Structures, Abstract Data Types in Great Detail with Examples
👨‍💻 Dr Cat Can Code (Dr Han Duy Phan) has been programming since 2003, and been teaching at top Universities since 2013.
💖 Thank you very much for watching, please like & subscribe to see new videos more easily. Thank you for being part of the Cat Can Code Community 😻
=========================
Copyright © 2023 Dr. Han Duy Phan. All Rights Reserved.
Do Not Re-up; Do Not Download & Re-Distribute this Content.
Рекомендации по теме
Комментарии
Автор

Video rất bổ ích đối với các bạn yêu thích môn lập trình.

HaTTNguyen
Автор

I have a question:

My lecturer said is not "wrong" to express the worst case (big O) of a program as O(n!). However, the goal is to find the closest upperbound so that we can best describe its time efficiency.

He gave real life analogies, which made sense, but when it comes to programs like a nested for loop where both loops go over n elements:

Which is obviously O(n^2) - I dont understand how it is True that we can also classify it under O(n!)

Hamza-qsez
visit shbcf.ru