|
post and dicsuss your fav algorithms here
|
# ? Sep 5, 2016 18:42 |
|
|
# ? May 15, 2024 04:27 |
|
<?php //logout.php session_start(); session_destroy(); header("location: logout.php"); ?>
|
# ? Sep 5, 2016 18:56 |
|
I just use HashMap for everything, op
|
# ? Sep 5, 2016 18:59 |
|
while(true){ cout << "Penus "; }
|
# ? Sep 5, 2016 19:01 |
|
bresenham line algorithm is pretty much the only one I understand & have inplemented
|
# ? Sep 5, 2016 19:41 |
|
shor's algorithm
|
# ? Sep 5, 2016 19:45 |
|
but what are some of the trendiest algorithms? I wanna be the hip programmer
|
# ? Sep 5, 2016 19:59 |
|
code:
|
# ? Sep 5, 2016 20:05 |
|
|
# ? Sep 5, 2016 20:49 |
|
he's gotten flat and fat
|
# ? Sep 5, 2016 20:56 |
|
algorithms? yeah i got some
|
# ? Sep 5, 2016 21:57 |
|
The Management posted:I just use HashMap for everything, op unironic answer to most interview questions
|
# ? Sep 6, 2016 05:53 |
|
i like algorithm
|
# ? Sep 6, 2016 06:29 |
|
The Traveling Dick Kicker (TDK) problem:code:
|
# ? Sep 6, 2016 06:57 |
|
the only sorting algorithms I can remember are the joke ones
|
# ? Sep 6, 2016 09:13 |
|
karatsuba!
|
# ? Sep 6, 2016 10:10 |
|
fisher-yates bithc
|
# ? Sep 6, 2016 14:12 |
|
code:
|
# ? Sep 6, 2016 16:20 |
|
Gazpacho posted:
lol
|
# ? Sep 6, 2016 16:33 |
|
i like to algorithm when i get the blues
|
# ? Sep 6, 2016 18:35 |
|
Loving Africa Chaps posted:algorithms? yeah i got some
|
# ? Sep 6, 2016 22:26 |
|
qntm posted:the only sorting algorithms I can remember are the joke ones i remember the general outline of how some of them work. but if i ever find myself in a 1980s action movie scenario, and to defuse the bomb i would need to implement a bug-free quicksort from memory, well, that school bus full of puppies ain't gonna make it
|
# ? Sep 7, 2016 04:30 |
|
i could do the haskell not actually in place version of quicksort to defuse the bomb i think
|
# ? Sep 7, 2016 04:53 |
|
i'm pretty sure i could also do sleep sort to defuse the bomb but thats it
|
# ? Sep 7, 2016 04:54 |
|
you cut one wire and if it explodes you reject the PR duh
|
# ? Sep 7, 2016 05:25 |
|
Jonny 290 posted:you cut one wire and if it explodes you reject the PR no you approve with comments and it just automerges and blows up everything.
|
# ? Sep 7, 2016 12:07 |
|
Fonz sort is when you go up to sort the array but it's already sorted because you're just that awesome, eyyyy checking that the array might be already sorted improves the best-case performance of some algorithms from O(n log n) to O(n), e.g. Fonz merge sort, Fonz heap sort
|
# ? Sep 7, 2016 12:40 |
|
stooge sort is the best * if the last element is smaller than the first, swap them * if the list is of length >= 3 -- recurse on the first 2/3 of the list -- recurse on the last 2/3 of the list -- recurse on the first 2/3 of the list again * done!
|
# ? Sep 7, 2016 13:11 |
|
has anyone said "Djikstra's out for Harambe" yet
|
# ? Sep 7, 2016 18:03 |
|
Glans Dillzig posted:has anyone said "Djikstra's out for Harambe" yet that's the joke!!!!!!!! DONT THREAD ON ME fucked around with this message at 18:47 on Sep 7, 2016 |
# ? Sep 7, 2016 18:37 |
|
Cybernetic Vermin posted:stooge sort is the best
|
# ? Sep 7, 2016 20:42 |
|
MALE SHOEGAZE posted:that's the joke!!!!!!!! sorry, I don't "get" jokes unless they're all spelled out for me
|
# ? Sep 7, 2016 21:11 |
|
Gazpacho posted:its fun to work through the reasoning of why tihs is a working sort (nobody post the reasoning) are there some subtle tricky parts to it? b/c to me it just looks like a silly overcomplicated version of quicksort and bubblesort mashed together
|
# ? Sep 7, 2016 21:57 |
|
the best algorithm is actually johnson trotter welp ttyl
|
# ? Sep 7, 2016 22:10 |
|
i made an alorithm to solve traveling salesman in O(n) time but i can't be bothered to tell you
|
# ? Sep 7, 2016 22:12 |
|
Lutha Mahtin posted:are there some subtle tricky parts to it? b/c to me it just looks like a silly overcomplicated version of quicksort and bubblesort mashed together depends on your intuition, but the way it doesn't ever really look at the whole list at once makes for some mental gymnastics to convincingly argue that everything will in the end end up in the right places if you find that too easy the next step is to figure out the computational complexity of it
|
# ? Sep 7, 2016 22:16 |
|
Awia posted:i made an alorithm to solve traveling salesman in O(n) time but i can't be bothered to tell you well yeah, you just have to find out if pittsburgh is in the list. why would you go anywhere else? hobbesmaster fucked around with this message at 22:29 on Sep 7, 2016 |
# ? Sep 7, 2016 22:17 |
|
hobbesmaster posted:well yeah, you just have to find out of if pittsburgh is in the list. why would you go anywhere else? dont share my secrets!
|
# ? Sep 7, 2016 22:20 |
|
Cybernetic Vermin posted:depends on your intuition, but the way it doesn't ever really look at the whole list at once makes for some mental gymnastics to convincingly argue that everything will in the end end up in the right places maybe im misremembering my algorithms basics, but i thought "doesn't look at the whole thing at once" was the idea behind the divide and conquer strategy. stooge just does it in a very silly way quote:if you find that too easy the next step is to figure out the computational complexity of it nah, i'm cool
|
# ? Sep 8, 2016 01:19 |
|
|
# ? May 15, 2024 04:27 |
|
i wrote this sorting algorithm for u, given a numerically indexed array it prints the values in sorted ordercode:
The MUMPSorceress fucked around with this message at 05:36 on Sep 8, 2016 |
# ? Sep 8, 2016 05:22 |