Downloaded 58 times
![void quick_sort (int *a, int n) {
if (n < 2)
return;
int p = a[n / 2];
int *l = a;
int *r = a + n - 1;
while (l <= r) {
if (*l < p) { l++; }
else if (*r > p) { r--; }
else {
int t = *l;
*l = *r;
*r = t;
l++;
r--;
}
}
quick_sort(a, r - a + 1);
quick_sort(l, a + n - l);
}](https://image.slidesharecdn.com/talesfromaradicallypolyglotteam-141003080309-phpapp02/85/Tales-from-a-radically-polyglot-team-15-320.jpg)
![qsort :: Ord a => [a] -> [a]
qsort [] = []
qsort (x:xs) = qsort less ++ [x] ++ qsort greater
where
less = [ y | y <- xs, y < x ]
greater = [ y | y <- xs, y >= x ]](https://image.slidesharecdn.com/talesfromaradicallypolyglotteam-141003080309-phpapp02/85/Tales-from-a-radically-polyglot-team-16-320.jpg)
Uploaded byThoughtworks
Tales from a radically polyglot team
The document discusses the challenges and benefits of maintaining a radically polyglot programming team that uses over ten languages. It emphasizes the increasing complexity of software development as computational power grows, and highlights both the advantages of diverse skill sets, such as flexibility and innovation, and the potential drawbacks like context switching and deployment issues. The author advocates for embracing polyglotism to enhance productivity and employee satisfaction.
More Related Content
Similar to Tales from a radically polyglot team
Tales from a radically polyglot team
- 1.
- 2.
- 4.
- 10.
- 11.
- 12. The major causeof the software crisis is that the machines have become several orders of magnitude more powerful! To put it quite bluntly: as long as there were no machines, programming was no problem at all…
- 13. …When we hada few weak computers, programming became a mild problem, and now we have gigantic computers, programming has become an equally gigantic problem. Edsger W. Dijkstra
- 15. void quick_sort (int*a, int n) { if (n < 2) return; int p = a[n / 2]; int *l = a; int *r = a + n - 1; while (l <= r) { if (*l < p) { l++; } else if (*r > p) { r--; } else { int t = *l; *l = *r; *r = t; l++; r--; } } quick_sort(a, r - a + 1); quick_sort(l, a + n - l); }
- 16. qsort :: Orda => [a] -> [a] qsort [] = [] qsort (x:xs) = qsort less ++ [x] ++ qsort greater where less = [ y | y <- xs, y < x ] greater = [ y | y <- xs, y >= x ]
- 17.
- 20.
- 25.
- 26.
- 27.
- 28. Bash Clojure C# Go Haskell Java JavaScript/ Node.js Objective-C Python Ruby Scala
- 29.
- 30.
- 31. 1 2 3 4 5
- 32.
- 33.
- 35. We want to develop quicker
- 37. We want thesystem to run faster
- 39. We want to be more expressive
- 41. We want to learn
- 44. Is this reallya good thing ?
- 45.
- 46.
- 47.
- 48.
- 49.
- 51.
- 52. The Fallacy of General Purpose
- 53. The Spread of Ideas
- 54.
- 56.
- 57. The Right Tool ! for the Job
- 58.
- 60.
- 61.
- 62.
- 63.