Interesting that you can make a quicksort without being able to index your input. It may be O(n log n) for comparisons but it is O(n) for channels and go routines so perhaps not the most efficient quicksort ever ;-)
It also has the worst case complexity O(n²) if you feed it sorted input, so don't do that!
(a) The go version is 2.5 times faster than the Python version. This is actually less than I'd expect.
(b) The python version is readable. The go version is not. :-)
- Memset LtdTechnical Director, 2003 - present
- Emmanuel College, CambridgePhysics, 1986 - 1989
Requests: HTTP for Humans — Requests 0.8.3 documentation
Requests: HTTP for Humans¶. Release v0.8.3. (Installation). Requests is an ISC Licensed HTTP library, written in Python, for human beings. P
Meandering Through Mathematics: Numerical Analysis: How to Calculate Spe...
Your calculator has buttons for all sorts of special functions, like square root, sine, cosine, and logarithms. How does the calculator know
Doodling in Math: Spirals, Fibonacci, and Being a Plant [1 of 3]
Part 2 coming soon! (Two weeks, maybe?)
Is there another GCHQ Code Challenge? | John Graham-Cumming
Is there another GCHQ Code Challenge? Update: The answer is Yes, sort of. Last week GCHQ issued a 'code challenge' as a way of attra
Boot Multiple ISO from USB via Grub2 using Linux | USB Pen Drive Linux
Boot Multiple ISO from USB via Grub2 using Linux. Boot ISO Files directly from USB using Grub2 from Linux. Here is one way to create a Multi
Announcing Git Support for Google Code Project Hosting - Google Open Sou...
News about Google"s Open Source projects and programs