Post favorite algorithm, go!
Post favorite algorithm, go!
Mason Barnes
Other urls found in this thread:
en.wikipedia.org
youtube.com
en.wikipedia.org
algo.inria.fr
en.wikipedia.org
people.eecs.berkeley.edu
twitter.com
Isaiah Morris
heap sort
Nolan Clark
...
Tyler Peterson
heapster sort
Jonathan Adams
if (a > b && b < a)
Asher Miller
Ok, now I am intrigued, 3 IPs, all calling heap sort, why?
Also, op here, Möller–Trumbore triangle intersection is my choice.
Wouldn't be fair to have all you chaps tell me yours without showing you mine.
Logan Wood
>feminist frequency
yeah, you can fuck off to stack overflow, reddit or wherever is not here.
Jackson Reyes
The algorithm that sorts randomly, and if the assortment is correct then it ends
Cooper Bennett
A* search
Luis Brown
sleep sort?
it's the best most inefficient way to do anything.
Leo Moore
Looking at
en.wikipedia.org
What is cross? The external product?
Isaiah Stewart
I posted the gif, it's like some kind of anime move
HIDDEN TECHNIQUE:
HEAP SORT
Xavier Torres
Simplex
Ian Jackson
>What is cross? The external product?
as in cross product, yes.
it's still one of, if not the fastest ways to do non-proprietary triangle intersections.
Charles Fisher
Shor's algorithm.
Jace Rogers
Ayyy just gimme dat (You)
Oliver Allen
simple but very useful
>d^2=(a2-a1)^2+(b2-b1)^2+(c2-c1)^2
Josiah Bennett
Haha yeah that one.
Cameron Nelson
I've always found the Cholesky decomposition interesting
David Taylor
Yes. According to wikipedia, the cross product is the external product.
Giving someone name to that algorithm is like the "relation de Chasles" (Segment addition postulate). We shouldn't give people name to such trivial task.
Logan Long
I haven't decided which one is my favourite, but I remember that I really liked Particle Swarm Optimization.
Juan Gomez
sleep sort
William Kelly
Oh, and Fuzzy C-Means!
Caleb Sanders
Bubble sort
Tyler Bennett
xor swap.
useless and obsolete nowadays, but when i saw it the first time it blew me away.
Lincoln Williams
Weak quickheap sort.
I think there was a variation that added another similar word to the beginning, but I can't remember it.
Jason Foster
One Time Pad
Liam Roberts
Very hard to use irl tho
Thomas Thompson
Yes, but I like the fact that it's mathematically proven to be secure and that it's simple.
Carson Jackson
True
Carter Peterson
Hashlife
Eli Allen
Comparing the distances of two objects and only having to compare dot products, saving myself a square root.
Anything involving simd. AVX in particular
Alexander Perez
FFT multiplication is useful and cool as hell.
Samuel Allen
draw a circle of radius r (pixels)
count pixels inside circle
divide by r^2
---
approximation for pi
Nathan James
Currently implementing a very fast merge sort using AVX. How rich am I gonna get.
Dominic Torres
Cross product. Ray marching. Euler method integration.
Jose Johnson
0x5f3759df
Noah Reyes
recursive descending parsing
Ian Cook
>google this
>it's a link i've already visited
slightly salty about this
Jackson Turner
Shunting yard, because it's the progenitor to operator-precedence.
James Rodriguez
Also are you using this thread to find out useful algos, OP? Or are you just curious?
Gavin Ortiz
Here's one, twos compliment.
Mason Flores
Asher Reed
...
Oliver Bailey
The only way to sort your shit, figuratively and literally.
Jaxson Kelly
Currently making a git and write-up of a string/generic-array reversal algorithm that beats std::reverse with a speedup of x12 on large arrays and is only marginally slower on smaller arrays due to slight overhead
Brody Bell
>someone put in the time to make that
Leo Reed
...
James Anderson
Kruskal's algorithm
Christopher Evans
Floyd :^)
Connor Torres
xorshift+, literally 4 xors, 3 shifts and one add for 128 bits of quality pseudorandomness.
Nathaniel Walker
That's more or less how pi was originally calculated, before everyone figured out the infinite series.
Robert Hill
Hyper log log counting.
algo.inria.fr
en.wikipedia.org
Such a fascinating idea.
Bentley Barnes
super useful in time series statistics. big fan
Carson Jenkins
Tarski fixed point theorem. While the algorithm to find the fix point is very simple, the power of doing so is incredible.
Where as determining if two regular languages are equivalent is done in exponential time, while determining bisimularity can be done in polynomial time.
William Smith
I recognize C++ when I see it
Anthony Campbell
Isaac Mitchell
Streaming algorithms are neat.
Isaac Garcia
// what the fuck?