<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[firstway的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/firstway</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; firstway]]></copyright><item><title><![CDATA[ 100个著名初等数学问题 (ZZ from mitbbs)]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/1383155</link><guid>https://blog.youkuaiyun.com/firstway/article/details/1383155</guid><author>firstway</author><pubDate>Tue, 14 Nov 2006 10:50:00 +0800</pubDate><description><![CDATA[100个著名初等数学问题  标  题: 100个著名初等数学问题 (ZZ from mitbbs)发信站: 南京大学小百合站 (Tue Nov 14 01:48:21 2006)    以下100个问题大部分不需要复杂计算和高等数学知识，更不需要了解太多的数学公式。如果建模正确，通常可以很快解答，非常适合面试的brain test，事实上CS和Finance行业的很多面试问题都和他们大同小]]></description><category></category></item><item><title><![CDATA[google专利2则]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/1379929</link><guid>https://blog.youkuaiyun.com/firstway/article/details/1379929</guid><author>firstway</author><pubDate>Sun, 12 Nov 2006 11:13:00 +0800</pubDate><description><![CDATA[申 请 (专利) 号：       200480024370.3      申   请   日：       2004.06.30名           称：      利用用户主题兴趣信息,随同具有一个或多个主题的文档表现广告公 开 (公告) 号：      CN1842792     公开(公告)日：      2006.10.04主  分  类  号：      G06F17/30(2006]]></description><category></category></item><item><title><![CDATA[推荐：招聘的吹牛体系（转载）]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/1369405</link><guid>https://blog.youkuaiyun.com/firstway/article/details/1369405</guid><author>firstway</author><pubDate>Mon, 06 Nov 2006 13:14:00 +0800</pubDate><description><![CDATA[标  题: 招聘的吹牛体系（转载）发信站: 南京大学小百合站 (Sun Nov  5 00:05:26 2006)和　　Ellen最近老是在MSN上喋喋不休地和我讨论新工作的事情。事情倒也不复杂，刚准备从前一家公司出来的她，最近得到了两份offer，一份offer的薪水是8000，一份则是12000。　　　　但导致她喋喋不休的原因倒并不是抱怨这两份辛苦工作的可怜薪水，而是她在这两个准东家公司的所谓]]></description><category></category></item><item><title><![CDATA[直接排序]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/1333131</link><guid>https://blog.youkuaiyun.com/firstway/article/details/1333131</guid><author>firstway</author><pubDate>Fri, 13 Oct 2006 14:35:00 +0800</pubDate><description><![CDATA[#include "stdio.h"void ExChange(int &A,int &B){    int tt = A;    A = B;    B = tt;};void Strai_Sele_Sort(int T[],int N) //非递归实现{    int i,J;    for(i=0;i    {        for(J=i+1;J        {            i]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/1333126</link><guid>https://blog.youkuaiyun.com/firstway/article/details/1333126</guid><author>firstway</author><pubDate>Fri, 13 Oct 2006 14:32:00 +0800</pubDate><description><![CDATA[//结果（从小到大）void QuickSort(int T[],int N){    if(N    int *pBegin = T;    int *pEnd =T+N-1;    int CurData = T[0];    bool bBefore = true;    while(pBegin     {        if(bBefore)        {            if]]></description><category></category></item><item><title><![CDATA[堆排序（大根堆）]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/1333008</link><guid>https://blog.youkuaiyun.com/firstway/article/details/1333008</guid><author>firstway</author><pubDate>Fri, 13 Oct 2006 13:04:00 +0800</pubDate><description><![CDATA[#include "stdio.h"bool MaxOrEqual(int a0,int a1){    if(a0     return true;};bool MaxOnly(int a0,int a1){    if(a0 > a1) return true;    return false;};void ChangeEach(int &A,int &B){    int tt = A;  ]]></description><category></category></item><item><title><![CDATA[fifo1.c]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/603749</link><guid>https://blog.youkuaiyun.com/firstway/article/details/603749</guid><author>firstway</author><pubDate>Mon, 20 Feb 2006 19:25:00 +0800</pubDate><description><![CDATA[#include "unistd.h"#include "stdio.h"#include "stdlib.h"#include "string.h"#include "time.h"#define BUFSIZE 32int main() {         int fifo_fd[2];     int result=-1;     char buf[BUFSIZE];      if(pip]]></description><category></category></item><item><title><![CDATA[fun.h文件]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/564430</link><guid>https://blog.youkuaiyun.com/firstway/article/details/564430</guid><author>firstway</author><pubDate>Wed, 28 Dec 2005 20:35:00 +0800</pubDate><description><![CDATA[//注意保存为fun.h文件#include "stdio.h" #define MAXSIZE 40 int COUNT=0;//全局，节点个数 //------------------------------------------  //学生结构体定义 struct STU {         char name[30];     int age;     char ban[40];    ]]></description><category></category></item><item><title><![CDATA[主函数（main.c）]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/564428</link><guid>https://blog.youkuaiyun.com/firstway/article/details/564428</guid><author>firstway</author><pubDate>Wed, 28 Dec 2005 20:34:00 +0800</pubDate><description><![CDATA[//main()函数#include "fun.h"   int menu() {     int i;     //printf("请按任意键开始.......");          printf("|------------------请选择(数字)----------------|/n");     printf("|  1---查看所有学生信息.                     ]]></description><category></category></item><item><title><![CDATA[The 46 Best-ever Freeware Utilities-some]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/559578</link><guid>https://blog.youkuaiyun.com/firstway/article/details/559578</guid><author>firstway</author><pubDate>Thu, 22 Dec 2005 21:02:00 +0800</pubDate><description><![CDATA[The             46 Best-ever Freeware Utilities            There are a lot of great             freeware products out there. Many are as good or even better than             their commercial a]]></description><category></category></item><item><title><![CDATA[debian试用手记]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/544134</link><guid>https://blog.youkuaiyun.com/firstway/article/details/544134</guid><author>firstway</author><pubDate>Mon, 05 Dec 2005 16:36:00 +0800</pubDate><description><![CDATA[在vmware里面安装debian使用debian-31r0a-i386-netinst.iso，大小只有100M多开始安装还是比较顺利，配置是在安装之后的。netinst装完后就有一个基本系统，重启进入base-config,这里记得一点，在选择sources.list的源时，可以加入如debian.cn99.com,.有光盘的源的目的时保证当你光盘有需要的包时，不从网上下载，以确保软件包不重复]]></description><category></category></item><item><title><![CDATA[深入理解sizeof]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/538566</link><guid>https://blog.youkuaiyun.com/firstway/article/details/538566</guid><author>firstway</author><pubDate>Mon, 28 Nov 2005 16:48:00 +0800</pubDate><description><![CDATA[                                    深入理解sizeof作者：房秉毅            　　最近在论坛里总有人问关于sizeof的问题，并且本人对这个问题也一直没有得到很好的解决，索性今天对它来个较为详细的总结，同时结合strlen进行比较，如果能对大家有点点帮助，这是我最大的欣慰了。一、好首先看看sizeof和strlen在MSDN上的]]></description><category></category></item><item><title><![CDATA[sizeof（）]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/538559</link><guid>https://blog.youkuaiyun.com/firstway/article/details/538559</guid><author>firstway</author><pubDate>Mon, 28 Nov 2005 16:46:00 +0800</pubDate><description><![CDATA[MSDN上如何对sizeof进行定义的：sizeof Operatorsizeof expressionThe sizeof keyword gives the amount of storage, in bytes, associated with a variable or a type (including aggregate types). This keyword r]]></description><category></category></item><item><title><![CDATA[Table of ASCII Characters]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/504420</link><guid>https://blog.youkuaiyun.com/firstway/article/details/504420</guid><author>firstway</author><pubDate>Sat, 15 Oct 2005 17:11:00 +0800</pubDate><description><![CDATA[Table of ASCII CharactersThis table lists the ASCII characters and their decimal, octal and hexadecimal numbers. Characters which appear as names in parentheses (e.g., (nl)) are non-printing character]]></description><category></category></item><item><title><![CDATA[test gethostbyname()]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/503979</link><guid>https://blog.youkuaiyun.com/firstway/article/details/503979</guid><author>firstway</author><pubDate>Fri, 14 Oct 2005 19:39:00 +0800</pubDate><description><![CDATA[#include "stdio.h"#inxlude "netdb.h"#inxlude "netinet/in.h"#inxlude "arpa/inet.h"int main(int argc,char* argv[]){ struct hostent *hp; struct in_addr in; struct sockaddr_in local_addr;  if(argc  if(!(h]]></description><category></category></item><item><title><![CDATA[RFC1945]]></title><link>https://blog.youkuaiyun.com/firstway/article/details/502945</link><guid>https://blog.youkuaiyun.com/firstway/article/details/502945</guid><author>firstway</author><pubDate>Thu, 13 Oct 2005 18:57:00 +0800</pubDate><description><![CDATA[组织：中国互动出版网（http://www.china-pub.com/）RFC文档中文翻译计划（http://www.china-pub.com/compters/emook/aboutemook.htm）E-mail：ouyang@china-pub.com译者：黄晓东（黄晓东  xdhuang@eyou.com）译文发布时间：2001-7-14版权：本中文翻译文档版权归中国互动出版网所有。可]]></description><category></category></item></channel></rss>