Question

how can we modify any algorithm to have a good best case running time?

Answer 1

it depends up on the algorithm. Achieving best case running time always is very difficult. We can increase the chance of gettin a best case running time by handling common cases separately at the beginning itself, and by terminating the loops if the goal is reached (Use of 'break;') and to have extra space (if affordable) and save any data which has potential use in the future to prevent extra runs... etc

Answer 2

\(\Huge{\color{red}{\bigstar}\color{blue}{\bigstar}\color{green}{\bigstar}\color{yellow}{\bigstar}\color{orange}{\bigstar}\color{red}{\bigstar}\color{blue}{\bigstar}\color{green}{\bigstar}\color{yellow}{\bigstar}\color{orange}{\bigstar}\color{red}{\bigstar}\color{blue}{\bigstar}\color{green}{\bigstar}\color{yellow}{\bigstar}}\\\color{white}{.}\\\Huge\sf\color{blue}{~~~~Welcome~to~OpenStudy!~\ddot\smile}\\\color{white}{.}\\\\\Huge{\color{red}{\bigstar}\color{blue}{\bigstar}\color{green}{\bigstar}\color{yellow}{\bigstar}\color{orange}{\bigstar}\color{red}{\bigstar}\color{blue}{\bigstar}\color{green}{\bigstar}\color{yellow}{\bigstar}\color{orange}{\bigstar}\color{red}{\bigstar}\color{blue}{\bigstar}\color{green}{\bigstar}\color{yellow}{\bigstar}}\)

Answer 3

"Welcome to OpenStudy. I can answer your questions or guide you. Please use the chat for off topic questions. And remember to give the helper a medal, by clicking on "Best Answer". We follow a code of conduct, ( http://openstudy.com/code-of-conduct ). Please take a moment to read it."