C++博客-to myself 的分类学习日志-随笔分类-c programming

GBK & UTF8 & UTF16编码

kongkongzi — Mon, 05 Jan 2015 07:57:00 GMT

GBK & UTF8 & UTF16编码：

CJK

中日韩统一表意文字（CJK Unified Ideographs），目的是要把分别来自中文、日文、韩文、越文中，本质、意义相同、形状一样或稍异的表意文字（主要为汉字，但也有仿汉字如日本国字、韩国独有汉字、越南的喃字）于ISO 10646及Unicode标准内赋予相同编码。CJK 是中文（Chinese）、日文（Japanese）、韩文（Korean）三国文字的缩写。顾名思义，它能够支持这三种文字。实际上，CJK 能够支持在 LaTeX 中使用包括中文、日文、韩文在内的多种亚洲双字节文字。

Unicode: http://www.unicode.org/

kongkongzi 2015-01-05 15:57 发表评论

signed char 的取值范围及其在struct sockaddr中的显示

kongkongzi — Tue, 18 Nov 2014 06:48:00 GMT

signed char 的取值范围及其在struct sockaddr中的显示：

kongkongzi 2014-11-18 14:48 发表评论

Socket

kongkongzi — Wed, 13 Oct 2010 16:30:00 GMT

摘要: /* client ---- use TCP. */#include #include #include #include #include 阅读全文

kongkongzi 2010-10-14 00:30 发表评论

Data Structure

kongkongzi — Wed, 13 Oct 2010 16:15:00 GMT

摘要: /* * stack.h */#ifndef STACK_H#define STACK_H/* * typedef item_t as const char*, or int, * or float, or others... 阅读全文

kongkongzi 2010-10-14 00:15 发表评论

Sort

kongkongzi — Wed, 13 Oct 2010 16:03:00 GMT

/*
* define a generic function bubble_sort which
* calls some sort function using bubble method.
*/
typedef int (*Func)(void *, int);

int bubble_sort(void *arrary[], int len, Func func)
{
    return (*func)(arrary, len);
}

int bubble_int(void *array, int len)
{
    int *p;
    int i, j, temp;

    p = (int *)array;
    for (i = 1; i < len - 1; i++)
        for (j = 0; j < len - i; j++)
            if (*(p+j) > *(p+j+1)) {
                temp = *(p+j);
                *(p+j) = *(p+j+1);
                *(p+j+1) = temp;
            }
    return 0;
}

/*
* from smaller to bigger.
* use bubble method to sort the interger array
* which has 'len' elements.
*/
int bubble_int(void *array[], int len)
{
    int *p;
    int i, j, temp;

    p = (int *)array;
    for (i = 1; i < len - 1; i++)
        for (j = 0; j < len - i; j++)
            if (*(p+j) > *(p+j+1)) {
                temp = *(p+j);
                *(p+j) = *(p+j+1);
                *(p+j+1) = temp;
            }
    return 0;
}

/*
* sort the array 'a' from the smaller to the bigger.
*/
void insertion_sort(int a[], int len)
{
    int i, j, key;

    for (j = 1; j < len; j++) {
        key = a[j];
        i = j - 1;
        while (i >= 0 && a[i] > key) {
            a[i+1] = a[i];
            i--;
        }
        a[i+1] = key;
    }
}

/*
* sort the array 'a' from the smaller to the bigger.
*/
void merge(int a[], int start, int mid, int end)
{
    int i, j, k;
    int n1 = mid - start + 1;
    int n2 = end - mid;
    int *L = malloc(sizeof(int) * (n1 + 1));
    int *R = malloc(sizeof(int) * (n2 + 1));
    for (i = 0; i < n1; i++)
        L[i] = a[start+i];
    for (j = 0; j < n2; j++)
        R[j] = a[mid+1+j];
    L[n1] = R[n2] = 0x7fffffff;
    i = j = 0;
    for (k = start; k <= end; k++) {
        if (L[i] < R[j]) {
            a[k] = L[i];
            i++;
        } else {
            a[k] = R[j];
            j++;
        }
    }
    free(L);
    free(R);
}
void merge_sort(int a[], int start, int end)
{
    int mid;

    if(start < end) {
        mid = (start + end) / 2;
        merge_sort(a, start, mid);
        merge_sort(a, mid + 1, end);
        merge(a, start, mid, end);
    }
}

kongkongzi 2010-10-14 00:03 发表评论

C/C++点滴（二）

kongkongzi — Wed, 13 Oct 2010 15:43:00 GMT

摘要: /* create and destroy a two-dimension array. */#include #include using namespace std;int** create_td_arr(int&... 阅读全文

kongkongzi 2010-10-13 23:43 发表评论

C/C++点滴（一）

kongkongzi — Wed, 13 Oct 2010 14:35:00 GMT

摘要: /* * get the value of of the "pos" position * of the binary 0f "num". */int get_bit(int num,int&nb... 阅读全文

kongkongzi 2010-10-13 22:35 发表评论

反转单链表

kongkongzi — Wed, 13 Oct 2010 14:12:00 GMT

#include <iostream>

struct Node
{
    int id;
    struct Node *pNext;
};
typedef struct Node *Link; // 需要typedef，否则同时定义多个指针的时候不能写在同一行。

void reverseList(Link *ppHead) // 需要传递头节点的指针的地址，这是为了修改这个值。
{
    Link p = *ppHead;
    Link q, r; // <=> Node *q, *r;
    q = p->pNext;
    p->pNext = NULL;
    while (q != NULL)
    {
        r = q->pNext; // 需要预先保存第三个节点的位置。

        q->pNext = p;

        p = q; // 把p，q 同时往后移一个位置。
        q = r;
    }
    *ppHead = p;
}

void printList(const Link pHead)
{
    Link p = pHead;
    while (p != NULL)
    {
        std::cout << p->id << " ";

        p = p->pNext;
    }

    std::cout << std::endl;
}

int main(void)
{
    Link pHead, pPrev, pNext;
    pHead = new Node;
    pHead->id = 1;
    pHead->pNext = NULL;
    pPrev = pHead;
    for (int i = 1; i < 5; i++)
    {
        pNext = new Node;
        pNext->id = i + 1;
        pNext->pNext = NULL;

        pPrev->pNext = pNext;
        pPrev = pNext;
    }

    printList(pHead);

    reverseList(&pHead);

    printList(pHead);

    return 0;
}

kongkongzi 2010-10-13 22:12 发表评论