ProgramInATweet @ProgramInATweet

...and a sadly invalid Bash attempt:

@ProgramInATweet @ChrisBAshton My attempt in python: print open(__file__).read()

Retweeting the solutions to the previous challenge...

CHALLENGE: write a Quicksort function in under 140 characters. Extra points if it uses in-place partitioning or has clever pivot choices.

Got an interesting challenge for you this week: create the shortest possible quine. en.wikipedia.org/wiki/Quine_(co… You have until the 25th!

And a good attempt at Bash by @GideonPARANOID:

@ProgramInATweet import string as p s=raw_input().translate(None,p.punctuation); s=s.strip().split() s.sort(key=len, reverse=True) print s

CHALLENGE: write a function that takes a string and sorts words based on their length. It's exam season, so we'll give you a full week.

Happy New Year, terse coders! Watch this space for our next challenge. There'll be one sometime in the next seven days, we promise.

s=map(int,raw_input().split()) l=len(s) a=sum(s)/l v=sum([(a-i)**2 for i in s])/l print a,sorted(s)[(l-1)/2],max(set(s),key=s.count),v,v**.5

function a(l){ t={},n=d=0,k=l.sort().length l.forEach(function(v){ n+=v t[v]=t[v]?t[v]+1:1 d=t[d]<t[v]?v:d }) return[n/k,l[~~(k/2)],d] }

TODAY'S CHALLENGE: Find the mean, median & mode of an arbitrary list. Bonus points for variance and standard deviation. How far can YOU go?

@ProgramInATweet Python version! i=int(raw_input()) while True: i+=1 if len([x for x in range(2,i)if i%x==0])==0:break print i

function p(n) { var i,t while(1) { n=n<2?3:n+1 for(t=1,i=2;i<n;i++) if(n%i==0) t=-1 if (t>0) return n } } @ProgramInATweet

Who's up for some coding? Write a function that takes an int and returns the next prime number. The shorter the code, the bigger the win!

import string as p;s=raw_input().translate(None,p.punctuation);d={} for k in [w for w in s.split()]:d[k]=d[k]+1 if k in d else 1 print d