Synthesizing Algorithms

Stefan Reich
May 15, 2016 · 2 min read
0 10 i j for for ifless swap
task sort
i = 0
j = 0
for i = i, 10-1 do
for j = 0, i-1 do
if get(i) < get(j) then
swap(i, j)
end
end
end

Stefan Reich

Written by

Stefan believes in a Good Future and making robots. More on: http://ai1.lol

Welcome to a place where words matter. On Medium, smart voices and original ideas take center stage - with no ads in sight. Watch
Follow all the topics you care about, and we’ll deliver the best stories for you to your homepage and inbox. Explore
Get unlimited access to the best stories on Medium — and support writers while you’re at it. Just $5/month. Upgrade