61–70 of 394 posts
I like this bit of JavaScript for uniquifying an array: array.filter((item, index, arr) => arr.indexOf(item) === index) It works because indexOf returns the index of the first occurrence of the item, so you're asking whether this occurrence is the first occurrence.
The one that blew my mind when I was in college was a simplified version of quicksort in Haskell. It's just so elegant and clean. quicksort :: Ord a => [a] -> [a] quicksort [] = [] quicksort (p:xs) = (quicksort lesser) ++ [p] ++ (quicksort greater) where lesser = filter ( = p) xs Now surely someone may come along and point out how this isn't a true quicksort[0] because it doesn't partition the elements in place, but…
But the flaw you note unfortunately undermines performance... the "quick" in "quicksort".
Thus, IMHO it's a compelling illustration of the profound strengths and weaknesses of fp.
C++ STL algorithms written by Alexander Stepanov.
I like this bit of JavaScript for uniquifying an array: array.filter((item, index, arr) => arr.indexOf(item) === index) It works because indexOf returns the index of the first occurrence of the item, so you're asking whether this occurrence is the first occurrence.
This is O(n^2) though
Any of Norvig's notebooks, http://www.norvig.com/ipython/README.html , especially his Concrete Introduction to Probability https://nbviewer.jupyter.org/url/norvig.com/ipython/Probabil... .
FD 100
The next beautiful piece of code I came across in the same language was:
REPEAT 360 [FD 1 RT 1]
REPEAT 20 [REPEAT 180 [FD 1 RT 2] RT 18]
At an impressionable age of 9, reading and writing code like this, and using simple arithmetic, geometry, logic, and code to manipulate a two-dimensional world had a lasting effect on me. I like to believe that my passion for software engineering as well as my love for writing code, sharing code, and open source development are a result of coming across these beautiful code examples early in my life.
I like this bit of JavaScript for uniquifying an array: array.filter((item, index, arr) => arr.indexOf(item) === index) It works because indexOf returns the index of the first occurrence of the item, so you're asking whether this occurrence is the first occurrence.
const unique = [...new Set(arr)];John Carmack's Fast Inverse Square Root: https://en.wikipedia.org/wiki/Fast_inverse_square_root#Overv... . The first time I really and truly felt that people approach problems differently from how I, by default, go about them.
For me, the answer is - The code that never existed. Not to sound cheeky but eliminating code, is a beautiful thing. Less code is easier to maintain, understand, and faster to run. So the less code you can achieve, the better overall the software will be.
I like this bit of JavaScript for uniquifying an array: array.filter((item, index, arr) => arr.indexOf(item) === index) It works because indexOf returns the index of the first occurrence of the item, so you're asking whether this occurrence is the first occurrence.
Personally I like this one, although it only works for an array of primitive types. const unique = [...new Set(arr)];