views:

79

answers:

2

I've never worked with a language that didn't provide for some form of memory management, and thus managed to get by without ever really groking pointers.

I can dabble in C I guess, as a result of coding in Objective-C for a little while.

+3  A: 

Hmmm, maybe it's the single linked list.

Try it: create, populate, reverse, release a single linked list

struct node {
    int data;
    struct node *next;
};
pmg
And then graduating to double-linked lists and binary trees, I would say.
Keith B
I had hoped for more answers, but this is a good one nonetheless !
julien
A: 

I wouldn't call this "canonical", but I'm recreating [arrayOfStrings sortUsingSelector:@selector(compare:)]; using char * arrays and pure C code. It's sloppy and frustrating, but great practice and I'm loving it.

http://github.com/jkubicek/Objective-Sort/blob/master/Objective-Sort.m

kubi