OS X (Apple)

Yes, and no. What I meant is that if you know how the Quicksort algorithm works, you can do it in any language, no matter what the syntax for a loop is, as a language might not have a for construct (eg Whitespace or Brainfuck, both are Turing complete). Or, with the last example, you need to know that to solve the exercise, you need toThe algorithm is what you'd write out in Pseudocode, independent of any languages syntax.

P.S.:

Code:

printf("%%"); // Print a single %