Linux Format 155 On Sale Today - Discover Linux!

Get on board

Get on board the Linux bus. Destination: expertsville!

If you`re looking for a way into the weird and wonderful world of Linux (by weird we mean being able to install what you want without being branded a pirate. We also mean no longer having to worry about viruses corrupting your expensive machine), LOOK NO LONGER! This issue holds your hand and guides you through those first tentative steps to software freedom.

And there`s plenty more for the established Linux user: we cover advanced SSH, Arduino hacking and data-loss prevention in Drupal in the tutorials, plus there`s the Coding Academy, reviews (trust us, the Xfce desktop is going to get a lot more popular when people realise how good VectorLinux is), and we discover how Linux is making a difference to people`s lives in rural Zambia.

On the disc: Ubuntu remixed and 6 other distros. Neil Bothwick shows his mastery over optical media with our own Gnome 3 remix of Ubuntu and six other fully booting distros, as well as all the other great software we feature in the magazine.

Take a look at our archives for an issue overview:

You should follow us on or Twitter

Your comments


Just subscriped on Apple newsstand as my print subscription ran out. Now your fabolous magazine is delivered twice as fast at half the price. Genius!

~Andreas From
Danish subscriber for a couple of years :)

Typical LXF Team Exaggeration

I know Jonathan Roberts is relatively new to the team but did you really have to teach him your bad habits of exaggeration? :-)

In LXF 155, mostly a very good issue by the way, on pages 106/7 is Jonathan's Back to Basics article on sorting. His discussion of the Big O notation was very good but unfortunately the image caption on the first of those two pages says "Bubble sort is an algorithm with O(n^2) performance - that means it takes exponentially longer for every element added". I don't know how good Jonathan's maths education is but "exponentially" does not apply to what is a quadractic. An exponential would be O(c^n) where c is a constant. Exponential means it takes c "times" as much longer for each element added where as O(n^2) only takes "plus" some proportion of n longer for each element added. Exponential is therefore a lot worse. May be in LXF terms that would be a billion times worse :-)

Paul Cooper

@Paul Cooper

You're right,

Since I wrote that I have learned the difference! There was no intentional exaggeration, just the repetition of a popular misconception...

Anyhow, now I know the difference, I certainly won't be making the same mistake again. Glad you enjoyed the rest of the discussion, however, it's always nice to hear :-)

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

Username:   Password: