New answers tagged

4 votes

Counting universal n-ary logic gates

Python, 1648 bytes ...
gsitcia's user avatar
  • 3,171
1 vote

Robinson Schensted correspondence

Haskell, 177 bytes ...
matteo_c's user avatar
  • 5,803
1 vote

Robinson Schensted correspondence

J, 60 bytes g=.<`(/:~(-.;$:@])&;2<@-./\_"+]F:.(]`I.`[}~)])@.(1<#) ,:&g/: Attempt This Online! (Note: code won't actually run because ATO's J ...
Jonah's user avatar
  • 33k
3 votes

Robinson Schensted correspondence

R, 115 bytes \(x){P=Q=!x%o%x;for(i in x){r=1;while(i<-P[r,w<-which.min(P[r,]%in%1:i)]-!(P[r,w]=i))r=r+1;Q[r,w]=F=F+1};list(P,Q)} Attempt This Online! For an ...
Kirill L.'s user avatar
  • 13.7k
2 votes

Robinson Schensted correspondence

Python3, 559 bytes ...
Ajax1234's user avatar
  • 6,723
4 votes

Robinson Schensted correspondence

JavaScript (ES12), 124 bytes Returns [P, Q]. ...
Arnauld's user avatar
  • 188k
4 votes

Robinson Schensted correspondence

Charcoal, 66 bytes ≔Eθ⟦⟧ηFθ«≔⁰ζWΦ§ηζ›λ髧≔§ηζ⌕§ηζ⌊κι≔⌊κι≦⊕ζ»⊞§ηζι⊞υζ»E⟦η⊕Eθ⌕Aυκ⟧⭆¹Φιν Try it online! Link is to verbose version of code. Explanation: ...
Neil's user avatar
  • 166k

Top 50 recent answers are included