Algorithm and Data Structure
asicer
爱好编程工作
展开
-
string reverse
#include #include void string_reverse(char s[]){ int c, i, j; for (i=0, j=strlen(s)-1; i<j; i++, j--) { c = s[i]; s[i] = s[j];原创 2011-07-23 10:20:15 · 290 阅读 · 0 评论 -
endianness test
1 //All Rights Reserved 2 3 #include 4 5 int main() 6 { 7 int a=0x0001; 8 char *c=(char *)&a; 9 *c ? printf("little endian\n") : printf("big endian\n"); 10 r原创 2011-07-21 16:14:18 · 226 阅读 · 0 评论 -
collection of c interview questions
http://technical-interview.com/default.aspx//swap two variables without using a third variable//compiler dependenta^=b^=a^=b//only wor原创 2011-07-23 12:31:37 · 256 阅读 · 0 评论 -
great online resource
online eecs course:http://www-inst.eecs.berkeley.edu/classes-eecs.htmlhttp://ocw.mit.edu/courses/electrical-engineering-and-computer-sci原创 2011-07-24 14:42:16 · 254 阅读 · 0 评论 -
sort (draft)
//All Rights Reserved #include #include #define swap(a,b) { \ (a) ^= (b); \ (b) ^= (a); \ (a) ^= (b); \}#de原创 2011-07-29 00:41:42 · 202 阅读 · 0 评论 -
binaryTree (draft)
#include #include struct node{ int date; node *lchild, *rchild;};int getDepth(node *);int searchNode(node *);node *insertNode(nod原创 2011-07-22 10:19:28 · 199 阅读 · 0 评论 -
Queues
to be continued原创 2011-07-25 05:14:10 · 291 阅读 · 0 评论 -
Stacks
to be continued原创 2011-07-25 05:13:30 · 205 阅读 · 0 评论 -
single linkList (draft)
//All Rights Reserved #include #include struct node{ int age; struct node *next; }; void printList(node *N); node *insertNode(node *, int); node *deleteNode(node *, int); int ge原创 2011-07-21 16:41:41 · 252 阅读 · 0 评论