It has been around for more than a year, but is Android set to make open source the standard for mobile phone operating systems? We take a closer look.
This month’s column focuses on computational complexity and the lower bounds for algorithms. In particular, we’ll show that any algorithm to find the maximum in an array of N elements has a lower bound of O(N) by using an adversary argument.
May 22, 2013
amitsaha — Thank you for your kind comments everyone. I am glad it's been of help.
I am excited to announce my book:...
May 22, 2013
zero client — SUNDE desktop computing solutions are very much cost effective with environmental
concern. With SUNDE, your work place can turn out to...
May 22, 2013
tabsong — pretty nice
May 21, 2013
JKR — More efficient? Probably. More readable? Definitely not.
May 21, 2013
Prashanth Joshi — The author assumes that the first article being introductory in nature is for the beginners. So there is no question...
All published articles are released under Creative Commons Attribution-NonCommercial 3.0 Unported License, unless otherwise noted.
LINUX For You is powered by WordPress, which gladly sits on top of a CentOS-based LEMP stack.
.