this post was submitted on 08 Jun 2023
20 points (100.0% liked)

Programming

13932 readers
1 users here now

All things programming and coding related. Subcommunity of Technology.

This community's icon was made by Aaron Schneider, under the CC-BY-NC-SA 4.0 license.

founded 2 years ago
MODERATORS
alyaza@beehaw.org
Hexorg@beehaw.org
remington@beehaw.org
20
AlphaDev discovers faster sorting algorithms (www.deepmind.com)
submitted 2 years ago by ericjmorey@lemmy.world to c/programming@beehaw.org
9 comments fedilink hide all child comments
 

AlphaDev uncovered new sorting algorithms that led to improvements in the LLVM libc++ sorting library that were up to 70% faster for shorter sequences and about 1.7% faster for sequences exceeding 250,000 elements.

you are viewing a single comment's thread
view the rest of the comments
[–] Hexorg@beehaw.org 1 points 2 years ago (1 children)

This write up talks about sequences of 3 and 4 items… does their full paper generalize to variable sized lists?

[–] ericjmorey@lemmy.world 1 points 2 years ago* (last edited 2 years ago)

From the main section of the paper published in Nature (which is available for free):

Using AlphaDev, we have discovered fixed and variable sort algorithms from scratch that are both new and more efficient than the state-of-the-art human benchmarks. The fixed sort solutions for sort 3, sort 4 and sort 5 discovered by AlphaDev have been integrated into the standard sort function in the LLVM standard C++ library

It seems they did find improvements for sorting variable sized list but only the sort 3, sort 4 and sort 5 algorithms got implemented in LLVM.