What is worst case running time ?

Answer 1

Thanks 4 the rply

Answer 2

Better explained than I could:
https://en.m.wikipedia.org/wiki/Best,_worst_and_average_case

For the math
https://en.m.wikipedia.org/wiki/Big_O_notation

An example of the calculation
https://stackoverflow.com/questions/11948322/worst-case-running-time-calculation

Answer 3

The worst case would be infinity. But I guess you want to know something about the worst case scenario with actually getting a result.
A worst case is when your algorithm gets the worst input possible and therefore determines the maximum time it takes to solve a problem.
The opposite would be the best case which takes the shortest time.
Usually when analysing an algorithm you look at the average and worst case to determine the average and maximal runtime.
This measurement of estimated time taken is called time-complexity.

On Wikipedia you can find some examples for different algorithms:
https://en.m.wikipedia.org/wiki/Best,_worst_and_average_case#Examples