As we are very well aware that
the analysis of the algorithms is done by the calculating its time complexity
and space complexity. Talking about the time complexity which is represented by
asymptotic notations such as Big-Oh, Theta and Omega notations. This is
kind of analysis of algorithms is often called as asymptotic analysis of
algorithms. Basically using these notations we try to find the rate of
growth of algorithms when the input size n increases say to infinity. We
try to find how the time complexity will behave when the input
to an algorithm increases.
I got a Dell Inspiron few days back with Windows 8 installed on it. Its pretty cool but needed a Linux OS along with it so installed Ubuntu 13.04. It was easy setting up a PC on dual boot (Windows and Linux) back when legacy BIOS were in picture. But lately it has been replaced by its successor UEFI (Unified extensible firmware interface) and nowadays Windows 8 machines are coming with UEFI. Because of it, installing any Linux OS along with Windows 8 gives a hard time.