欧美极品高清xxxxhd,国产日产欧美最新,无码AV国产东京热AV无码,国产精品人与动性XXX,国产传媒亚洲综合一区二区,四库影院永久国产精品,毛片免费免费高清视频,福利所导航夜趣136

標題: 跳表SkipList [打印本頁]

作者: bibi 時間: 2015-4-18 20:55
標題: 跳表SkipList
跳表是平衡樹的一種替代的數據結構，但是和紅黑樹不相同的是，跳表對于樹的平衡的實現是基于一種隨機化的算法的，這樣也就是說跳表的插入和刪除的工作是比較簡單的。

一個測試程序示例, 下載壓縮包中已經包含(這里的源代碼對不齊):

// test.cpp

#include <iostream>

#include <iomanip>

#include <cstdlib>

#include <time.h>

#include "skiplist.h"

#include "TimeCounter.h"

#define TIME_START CTimeCounter* pT = new CTimeCounter()

#define TIME_END ShowTime(pT->GetExecutionTime())

//////////////////////////////////////////////////////////////////////////

// Show execution time (ms)

void ShowTime(__int64 nTime)

{

std::cout << "========================================" << std::endl;

std::cout << " Total time: ";

std::cout << std::fixed << std::setprecision(1) << std::setw(6);

std::cout << nTime;

std::cout << " ms" << std::endl << std::endl;

//printf("Usage time: %I64d millisecond\n\n", nTime); //在g++中對應的是<stdint.h> int64_t, 應該用%lld輸出

}

int main(){

int count = 10, i;

SkipList sl;

srand((unsigned)time(NULL));

std::cout<<"### Function Test ###\n\n";

std::cout<<"\n=== Init Skip List ===\n\n";

sl.Init();

for ( i = 0; i < count; i++) {

sl.Insert(i);

}

std::cout<<"\n=== Print Skip List ===\n\n";

sl.Print();

printf("\n=== Search Skip List ===\n\n");

TIME_START;

for (i = 0; i < count; i++) {

int value = rand()%(count+10);

sl.Search(value);

}

TIME_END;

std::cout<<"\n=== Delete Skip List ===\n\n";

char buf[256], *p = buf;

for (i = 0; i < count+10; i+=2) {

sprintf_s(buf, "Delete[%d]:%s\n", i, sl.Delete(i) ? "SUCCESS":"NOT FOUND");

std::cout<<buf;

}

std::cout<<"\n\n";

sl.Print();

sl.Free();

//或者Ctrl+F5調試

getchar();

}

歡迎光臨 (http://www.raoushi.com/bbs/)