Information Retrieval: Data Structures & Algorithms

Kevin_Zhang — Mon, 18 Apr 2011 04:22:00 GMT

http://orion.lcg.ufrj.br/Dr.Dobbs/books/book5/toc.htm

Information Retrieval: Data Structures & Algorithms
edited by William B. Frakes and Ricardo Baeza-Yates

FOREWORD
PREFACE

CHAPTER 1: INTRODUCTION TO INFORMATION STORAGE AND RETRIEVAL SYSTEMS

CHAPTER 2: INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS RELATED TO INFORMATION RETRIEVAL

CHAPTER 3: INVERTED FILES

CHAPTER 4: SIGNATURE FILES

CHAPTER 5: NEW INDICES FOR TEXT: PAT TREES AND PAT ARRAYS

CHAPTER 6: FILE ORGANIZATIONS FOR OPTICAL DISKS

CHAPTER 7: LEXICAL ANALYSIS AND STOPLISTS

CHAPTER 8: STEMMING ALGORITHMS

CHAPTER 9: THESAURUS CONSTRUCTION

CHAPTER 10: STRING SEARCHING ALGORITHMS

CHAPTER 11: RELEVANCE FEEDBACK AND OTHER QUERY MODIFICATION TECHNIQUES

CHAPTER 12: BOOLEAN OPERATIONS

CHAPTER 13: HASHING ALGORITHMS

CHAPTER 14: RANKING ALGORITHMS

CHAPTER 15: EXTENDED BOOLEAN MODELS

CHAPTER 16: CLUSTERING ALGORITHMS

CHAPTER 17: SPECIAL-PURPOSE HARDWARE FOR INFORMATION RETRIEVAL

CHAPTER 18: PARALLEL INFORMATION RETRIEVAL ALGORITHMS

Kevin_Zhang 2011-04-18 12:22 发表评论

Kevin_Zhang — Tue, 27 Jul 2010 00:40:00 GMT

//�U�性表的顺序表�C�法�Q�实现插入，查找�Q�删除操作，采用数组存储�?/span>
#include<stdio.h>
#include<stdlib.h>

int n;  //the number of elements

void print(int a[])//输出
{
    for(int i=0;i<n;i++)
        printf("%d ",a[i]);
    printf("\n");
}
int insert(int element,int pos,int a[])//插入
{   if(pos<0||pos>n)return 0;
    else
    {for(int i=n-1;i>=pos;i--)
      a[i+1]=a[i];
     a[pos]=element;
     n++;
    }
}

int del(int pos,int a[])//删除
{
    if(pos<0||pos>n)return 0;
    else
    {
        for(int i=pos;i<n-1;i++)
            a[i]=a[i+1];
        n--;
    }
    return 1;
}

int search(int element,int a[])//查找,如果查到�q�回该元素的下标��P��否则�q�回-1
{
    for(int i=0;i<n;i++)
        if(a[i]==element)return i;
    printf("没有此元素\n");
    return -1;

}
//m待插入或者待删除的元素的�?br>//pos待插入元素的位置

int main()
{   int m;int pos;
    printf("误��入元素个敎ͼ�");
    scanf("%d",&n);
    int *a=(int *)malloc((n+1)*sizeof(int));
    if(!a){printf("分配存储��p�|");return 0;}
    printf("请依��序输入整数序列�Q�\n");
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
    printf("误��入待插入元素值和下标�Q?/span>");
    scanf("%d%d",&m,&pos);
    insert(m,pos,a);
    print(a);
    printf("输入一个待查元素：");
    scanf("%d",&m);
    printf("%d\n",search(m,a));

    printf("误��入待删除元素的下标：");
    scanf("%d",&pos);
    del(pos,a);
    print(a);

    free(a);
    return 0;
}

Kevin_Zhang 2010-07-27 08:40 发表评论

久久综合一区二区三区,激情文学综合丁香,亚洲第一色中文字幕

Information Retrieval: Data Structures & Algorithms