/**************************

* initialize skip list * **************************/

if ((list.hdr = malloc(sizeof(Node) + MAXLEVEL*sizeof(Node *))) == 0) {

printf ("insufficient memory (initList)\n");

exit(1);

for (i = 0; i <= MAXLEVEL; i++)

list.hdr->forward[i] = NIL; list.listLevel = 0;

5. Литература

[] Donald E. Knuth. The Art of Computer Programming, volume 3. Massachusetts:

Addison-Wesley, 1973. Есть русский перевод: Д.Кнут. Искусство программирования для ЭВМ. Т.3.

Изд-во "Мир", М.1978.

[2] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. New York: McGraw-Hill, 1992.

[3] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Massachusetts: Addison-Wesley, 1983.

[4] Peter K. Pearson. Fast hashing of variable-length text strings. Communications of the ACM, 33(6):677-680, June 1990.

[5] William Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668-676, June 1990.

6. Словарь