New #Sort dweets

function u(t) {

c.width=1920 // clear the canvas
for(i=0;i<9;i++)
x.fillRect(400+i*100+S(t)*300,400,50,200) // draw 50x200 rects

} // 122/140

Please log in (or register) to post a dweet (copy-paste the code somewhere safe to save it meanwhile)


    u(t) is called 60 times per second.
    t: Elapsed time in seconds.
    S: Shorthand for Math.sin.
    C: Shorthand for Math.cos.
    T: Shorthand for Math.tan.
    R: Function that generates rgba-strings, usage ex.: R(255, 255, 255, 0.5)
    c: A 1920x1080 canvas.
    x: A 2D context for that canvas.

Try the new frontend: beta.dwitter.net
Current theme challenge: #Opposites

show FPS hide FPS share fullscreen

0x61

function u(t) {

n=c.width|=1,t||(r=Array(n).fill().map(v=>Math.random()*n/2))
for(m=n;m--;){a=r[m];b=r[m-1];(a<b)&&(r[m-1]=a,r[m]=b)
x.fillRect(m,0,1,b)}

Nov 16 2024 11:03 AM UTC

}// 137/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

#BubbleSort

u/cantelope

#sort #sortingAlgorithms #bubblesort

show FPS hide FPS share 1 remix fullscreen

magna

function u(t) {

w=c.width|=0
t||(a=Array(w).fill(i=0).map(Math.random))
for(j=w;--j;a[i]>a[j]&&(R=a[i],a[i]=a[j],a[j]=R))x.fillRect(j,0,1,a[j]*1080)
i++

Oct 6 2021 11:57 PM UTC

}// 136/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Unbelievable Sort https://twitter.com/petarv_93/status/1445743…

u/ciaccodavide

#sort
u/magna

My implementation allegedly has a flaw that doesn't match the cursed behaviour of the original algo, but I wasn't able to immediately see it.

show FPS hide FPS share fullscreen

Alex

function u(t) {

t?b=a=t%14|0:l=[...{}+''].map(_=>Math.random())
c.width=1E3
l.map((n,i)=>x.fillRect(60*++i,500,30,-400*n))
l[a]=l[b+=l[a+1]<(v=l[a])]
l[b]=v

Mar 17 2021 11:41 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Sorting Algorithm

u/ciaccodavide

#sort

show FPS hide FPS share fullscreen

ciaccodavide

remix of d/21054 by u/ciaccodavide

function u(t) {

eval(unescape(escape`𪑦𚁴🐽𜀩𩡯𬠨𪐽𜠴𜀻𪐭𛐻𚑔𦱩𧐽𪐪𪐥𜰶𜀊𩡯𬠨𪐽𜠴𜀻𪐭𛐻𚑸𛡦𪑬𫁓𭁹𫁥👠𪁳𫀨𙁻𥁛𪑝𯐬𝀲𙐬𝐰𙑠𛁸𛡦𪑬𫁒𩑣𭀨𪐪𞀬𣀪𞀬𞀬𞀩𒡌🐫𚱌𙐱𜰵𒡷𪁩𫁥𚁔𦱐𧐼👔𦱐𚰱𧐩𤀫𚰊𭠽𥁛𤀫𜑝𒡔𦱐𚰱𧐽𥁛𤁝𛁔𦱐𧐽𭠬𤀽𜀠`.replace(/u../g,'')))}{L=0;P=0;

Dec 23 2020 9:08 AM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Bubble #Sort #visualization

u/katkip

awesomee!!

show FPS hide FPS share fullscreen

pavel

function u(t) {

for(i=c.width|=m=[h=1080];i--;)m[i]=i**3%h
m.sort((a,b)=>(t-=1/h)>0&&a-b).map((n,i)=>x.fillRect(i,h-n,1,n,x.fillStyle=`hsl(${n/9},69%,50%`))

Dec 22 2020 11:33 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Visualizing Array.sort

u/pavel

This probably works and is probably merge #sort :)
u/ciaccodavide

Nice!

show FPS hide FPS share 1 remix fullscreen

ciaccodavide

remix of d/21053 by u/ciaccodavide

function u(t) {

eval(unescape(escape`𩡯𬠨𨰮𭱩𩁴𪁼👩🐹𞐻𪐭𛐻𚑸𛡦𪑬𫁒𩑣𭀨𪐪𜐹𛀱𩐳𛀹𛀭𥡛𪑝𚐊𭱨𪑬𩐨𥡛𤁝🀽𥡛𤀫𜑝𚑐𚰫𒡶👖𦱐𚰱𧐊𥡛𤀫𜑝👖𦱐𧐬𥡛𤁝👶𛁐🐰`.replace(/u../g,'')))
}{V=[];for(i=99;i--;)V[i]=i**i%693;P=0

Dec 22 2020 11:09 PM UTC

}// 135/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Faster Slow Bubble #Sort Lines

show FPS hide FPS share 1 remix fullscreen

ciaccodavide

function u(t) {

for(c.width|=i=99;i--;)x.fillRect(i*19,1e3,9,-V[i])
if(V[P]>(v=V[P+1]))V[P+1]=V[P],V[P]=v,P=0
else P++}{V=[];for(i=99;i--;)V[i]=i**i%693;P=0

Dec 22 2020 10:59 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Slow Bubble Sort Lines

u/ciaccodavide

#sort

show FPS hide FPS share fullscreen

katkip

function u(t) {

if(!t){z=[];for(i=214;i--;)z.push(S(i*i))}
c.width|=0;for(i in z)x.fillRect(i*9,540,9,-(r=z[i])*540),(r<z[i-1])?(q=z[i-1],z[i-1]=r,z[i]=q):t

Dec 20 2019 1:15 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

I tried to make my first sorting algorithm. I don't know if this algorithm already exists but isn't very efficient. idea from d/16913 #sort #visualization

show FPS hide FPS share fullscreen

mildlybean

function u(t) {

for(r=X=c.width+=0;X-=2;t?T[X]>r?[T[X-1],T[X]]=[T[X],r]:0:T[X]=Math.random()*999)x.fillStyle=`hsl(${r/4},99%,45%`,x.fillRect(X,0,1,r=T[X++])

Dec 20 2019 12:38 AM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Bubble Sort

u/Odog8

duuuude
u/pavel

#sort has a few others
u/katkip

awesome #math
u/katkip

#visualization #graph

show FPS hide FPS share fullscreen

taupelink

remix of d/14386 by u/katkip

function u(t) {

c.width*=1
t||(a="Sort by new".split(""),i=m=0)
a[++i]>(q=a[m])||(a[m]=a[i],a[i]=q)
i%11||(i=++m)
x.font='9cm"';x.fillText(a.join(""),0,560)

Jun 4 2019 10:44 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

Amplifying the signal. I like "Sort by new" too! #sort

dwitter.net | #Sort