Question

in nuch oneration of
Data Structuree
a What do
mean best case and
you
worest case time compelexity?​

Answer 1

Answer:

In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. Usually the resource being considered is running time, i.e. time complexity, but could also be memory or other resource.

Answer 2

ℙℕℕ :

In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. Usually the resource being considered is running time, i.e. time complexity, but could also be memory or other resource.