[Data Structures]Merge sort
#include <stdio.h> #include <stdlib.h> void merge(int *dst, int *src, int left, int middle, int right) { int i,j,k; k = left; i = left; j = middle+1; while( i<=middle && j<=right ){ if(src[i] < src[j]){ dst[k++] = src[i++]; }else{ dst[k++] ...标签: Data Structures data_structures
[Data structures]Heap sort
#include <stdio.h> #include <stdlib.h> void heapAdjust(int *queue, int len, int start) { int p = start; int left = (p+1)*2 - 1; int right = (p+1)*2; int min = 0; int tmp; while( left <= len-1 ){ if(right <= len-1){ if(queue[left] < queue[right]){ min...标签: Data Structures data_structures
[Data Structures]Selection sort
#include <stdio.h> #include <stdlib.h> #define MAX 65535 void simpleSelectionSort(int seq[], int n) { int i; int j; int min; int exchange; for (i=0; i<n; i++) { min = MAX; /* Get the least number */ for (j=i; j<n; j++) { if (seq[j] < min) { mi...标签: Data Structures data_structures
[C] About phrash on function
#include <stdio.h> #include <stdlib.h> typedef struct _ss{ int a; int b; }ss; void fun( ss &s){ s.a = 2; s.b = 3; printf("fun:%d %d\n", s.a, s.b); } void fun2(ss *s){ s->a=55; printf("fun2:%d %d\n", s->a, s->b); } void fun3(ss *s){ fun(*s); ...标签: C
[C++] About pointer to base class
#include <stdio.h> #include <stdlib.h> class base{ public: int a; int b; int c; }; class hello:public base{ public: int c; int d; }; int main(){ base b; b.a = 1; b.b = 2; b.c = 5; hello *c; c =(hello *)&b; c->d = 3; printf(" %d %d...标签: C++
[Data Structures] Swap sort
#include <stdio.h> #include <stdlib.h> void bubbleSort(int seq[], int n) { int i; int j; int tmp; int exchange; for (i=0; i<n; i++) { exchange = 0; for (j=n; j>i; j--) { if (seq[j] < seq[j-1]) { /* swap j and j-1 */ tmp = seq[j]; seq[j] = ...标签: data_structures
[Data Structures] Insertion sort
#include <stdio.h> #include <stdlib.h> /* Straight insertion sort */ void straightInsertionSort(int seq[], int n) { int i; int j; int tmp; for (i=1; i<n; i++) {//From 1 tmp = seq[i];//Store yourself for (j=i-1; j>=0 && seq[j]>seq[i]; j--) {//Compare b...标签: Data Structures
[C++]An example of hash_map
#include <hash_map> #include <string> #include <iostream> using namespace std; using namespace stdext; int main(){ hash_map<string, string> mymap; mymap["aa"] = "Hello!"; mymap["bb"] = "You are who?"; mymap["cc"] = "See you!"; cout<<mymap["bb"]<<...标签: C++
[PHP]How to enable mod_expires&mod_headers in order to achive static cache
First: Open this line. LoadModule expires_module modules/mod_expires.so Second: Add this segment. <IfModule mod_expires.c> ExpiresActive On ExpiresByType text/html "now plus 5 minutes" ExpiresByType text/css "now p...标签: php
How to download ckplayer video
There is a simple program by which you can download the ckplayer video. After create the list of download URL, copy it to download tools. After download aff of the files. Use the command to compare into a big file in windows: copy/b E:\temps\*.ts E:\temps\new.ts There is the...日历
最新微语
- 有的时候,会站在分叉路口,不知道向左还是右
2023-12-26 15:34
- 繁花乱开,鸟雀逐风。心自宁静,纷扰不闻。
2023-03-14 09:56
- 对于不可控的事,我们保持乐观,对于可控的事情,我们保持谨慎。
2023-02-09 11:03
- 小时候,
暑假意味着无忧无虑地玩很长一段时间,
节假意味着好吃好喝还有很多长期不见的小朋友来玩...
长大后,
这是女儿第一个暑假,
一个半月...
2022-07-11 08:54
- Watching the autumn leaves falling as you grow older together
2018-10-25 09:45
分类
最新评论
- Goonog
i get it now :) - 萧
@Fluzak:The web host... - Fluzak
Nice blog here! Also... - Albertarive
In my opinion you co... - ChesterHep
What does it plan? - ChesterHep
No, opposite. - mojoheadz
Everything is OK!... - Josephmaigh
I just want to say t... - ChesterHep
What good topic - AnthonyBub
Certainly, never it ...