N Best Programming Techniques

From Compsci.ca Wiki

(Difference between revisions)
Jump to: navigation, search
(Added Dynamic Programming)
(Haskell)
Line 41: Line 41:
==Haskell==
==Haskell==
 +
<pre>
 +
fact 0 = 1
 +
fact n = n * (fact $ n - 1)
 +
</pre>
 +
==O'Caml==
==O'Caml==
<pre># let rec fact n =
<pre># let rec fact n =

Revision as of 03:16, 11 February 2007

Ten best programming techniques you're (probably) not using.


Contents


Pattern matching

Common Lisp (destructuring-bind)

[1]> (defun foo (a-list)
        (destructuring-bind (a &rest b) a-list
           (list a b)))
FOO
[2]> (foo '(1 2 3 4))
(1 (2 3 4))
[3]>

Erlang

-module(example).
-export(hello/1]).

hello("wtd") ->
    io:format("Hello, ~s!~n", [Name]);

hello(Name) ->
    io:format("Get out!!~n", []).

Haskell

fact 0 = 1
fact n = n * (fact $ n - 1)

O'Caml

# let rec fact n =
      match n with
          1 -> 1
        | o -> o * fact (o - 1);;
# let rec fact =
      function
          1 -> 1
        | o -> o * fact (o - 1);;
# let fact n =
      let rec fact' n acc =
          match n with
              1 -> acc
            | o -> fact (o - 1) (n * acc)
      in
          fact' n 1;;

SML/NJ

Templates/Generics

C++/D

Java/Scala

O'Caml/Haskell

Regular expressions

Anonymous functions/closures

Dynamic Programming

Personal tools