Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

Çë½Ì¼¸±¾CµÄÊé

´ó¼ÒºÃ£¬ÎÒÒ»Ö±ÏëÂò¼¸±¾CµÄÊ飬ÎÒÉÏÍø²éÁËһϣ¬ÏëÂòÒÔϼ¸±¾£º
£¨1£©CºÍÖ¸Õë
£¨2£©Ëã·¨£ºCÓïÑÔʵÏÖ £¨µÚ1-4²¿·Ö)»ù´¡ÖªÊ¶¡¢Êý¾Ý½á¹¹¡¢ÅÅÐò¼°ËÑË÷£¨Ô­ÊéµÚ3°æ£©Ó¢ÎÄÃûΪ£ºAlgorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 3rd Edition
£¨3£©Ëã·¨£ºCÓïÑÔʵÏÖ—µÚ5²¿·Ö£¬Í¼Ëã·¨(Ô­ÊéµÚ3°æ) Ó¢ÎÄÃûΪ£ºAlgorithms in C, Part 5: Graph Algorithms, 3rd Edition
¡¶³ÌÐòԱʹÓÃËã·¨¡·Ó¢ÎÄÃûΪ£ºPractical Algorithms for Programmers Õâ±¾ÊéÎÒÂòÁË£¬¸Ð¾õÄѶÈÓеã´ó£¬ËùÒÔÏëÂòÉÏÃæµÄ¼¸±¾Êé¡£
Õ⼸±¾ÊéÄѶȵ½µ×ÈçºÎ£¿Ï£Íû´ó¼ÒÃèÊöһϲ¢¸ø¸öÒâ¼û¡£Ð»Ð»¡£

»¹ÐУ¬µ«²»ÖªµÀÂ¥Ö÷µÄ»ù´¡ÖªÊ¶ÈçºÎ£¬²»¹ýÕ⼸±¾¶¼ÊǺÃÊéѽ

Õâ»ù±¾Êé¶¼ÓÐÒ»¶¨ÄѶÈ
×îºÃÊÇ×ö¹ýÒ»¶¨ÊýÁ¿µÄ³ÌÐòÖ®ºóÔÙ¶Á


Èç¹ûÂ¥Ö÷¸ÕѧµÄ»° ¿´Ì·ºÆÇ¿µÄ¾Í¹»ÁË - -£¬


ÎÒµÄÊýѧ»ù´¡ºÃ£¬ÎÒµÄC»ù´¡²»ËãºÜ²î£¬±à³ÌʵÏÖÁËÁ´±íÕâÖÖÊý¾Ý½á¹¹£¨Ë«Á´±í£¬µ¥Á´±í£¬Ñ­»·Á´±í£©°üÀ¨Á´±íµÄ²åÈ롢ɾ³ý¡¢ÅÅÐò¡¢²éÕÒ¡£ÎÒÒ²ÊdzõѧÊý¾Ý½á¹¹¡£1Â¥µÄÐÖµÜÄܲ»ÄÜ˵µÄ¾ßÌåµã£¿Ð»Ð»

ǧÍò±ðÂò¡£µ½Í¼Êé¹ÝÈ¥½èͬÀàµÄÊé¼®¡£
Ê飬·Ç½è²»ÄܶÁ¡£

£¨1£©CºÍÖ¸Õë
Ì·ºÆÇ¿µÄ¡¶c³ÌÐòÉè¼Æ¡·£¬Èô¶Á¶®ÁË£¬¸ù±¾¾Í²»ÐèÒªÔÙ¿´ËüÁË¡£

2£©Ëã·¨£ºCÓïÑÔʵÏÖ
ÑÏεÃôµÄ¡¶Êý¾Ý½á¹¹¡·£¬ÊÇ¿¼ÑеÄÖ¸µ¼½Ì²Ä¡£ÊÇÄã±ØÐë¶Á¶®µÄ¡£

Ìý˵Ëã·¨µ¼ÂÛÄѶÈÏ൱´ó£¬Õ⼸±¾ÊéÓÐûÓÐËã·¨µ¼ÂÛÕâ±¾ÊéÄѶȴó£¿

Õ⼸±¾Êé×ÔȻûÓÐËã·¨µ¼ÂÛ´ó£¬Ëã·¨µ¼ÂÛ½²ÀíÂ۵Ľ϶à
cºÍÖ¸Õë½²µÄ±È½Ïϸ£¬Ï°Ìâ²»´í



ÎÒ²»Ï²»¶ÀíÂÛ£¬ÎÒϲ»¶ÊµÕ½¡£

CºÍÖ¸Õë


Ëã·¨£ºCÓïÑÔʵÏÖ

¿´ÍêÕâÁ½±¾Ò²ËãÊDz»´íÁË£¬²»Ã÷°×µÄ»°£¬½


Ïà¹ØÎÊ´ð£º

¸ÕѧC£¬ÓÃCʵÏÖ±àÂë - C/C++ / CÓïÑÔ

#include"stdio.h"
#include"stdlib.h"
void ContrTwo(char i)
{
char str1[8];
itoa(i,str1,2);
printf("%s",str1);
}
unsigned char leftRot(char str,int i);
unsign ......

C/C++ÀïÆÁshift+f10¼üÒªÔõôд£¡ - C/C++ / C++ ÓïÑÔ

SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö
µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡
ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î
http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html ......

¸ß·ÖÇó!×îºÃÊÇC/C++ - C/C++ / CÓïÑÔ

·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ


ѧϰ£¬¿´¿´

¼ÌÐø¶¥Å¶

ѧϰÁË¡£

go o ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......

c¾²Ì¬±àÒëÁíÒ»¸öÎļþ¼ÐµÄ¿âº¯Êý - C/C++ / CÓïÑÔ

ÔÚ¸ùĿ¼/libÖдæ·ÅÒ»¸ölog.c£¬log.h£¬²¢ÓÃÏÂÃæµÄÓï¾ä£º
gcc -c log.c
ar crv liblog.a log.o
±àÒë³öÒ»¸öliblog.a¾²Ì¬¿â£¬È»ºóÔÚÎļþ¼Ð£º/testfileÖд´½¨Ò»¸ötest.cºÍtestc.c£¬test.cÖÐÒýÓÃÁËtestc.cÖж¨ÒåµÄ·½·¨ ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ