文件名称:modified_search_ordered_array
- 所属分类：
- Linux/Unix编程
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1kb
- 下载次数：
- 0次
- 提 供 者：
- nuk***
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
Problem Statement:
Given an ordered array A[1, n] of n ≥ 1 integers with A[1] ≤ A[2] ≤ · · · ≤ A[n], and an
integer x the problem is to determine integer i, 0 ≤ i ≤ n, such that
1) 1 ≤ i ≤ n and i is the largest index such that x ≥ A[i], and
2)i = 0 if there is no such index.
Prologue: The source code implements modified search in an ordered array given as the input. It gives the resultant index as the output and number of comparisons made.
Overview: The program uses the file descr iptors to take input array from input file and to give the resultant index and comparisons onto an output file.-Problem Statement:
Given an ordered array A[1, n] of n ≥ 1 integers with A[1] ≤ A[2] ≤ · · · ≤ A[n], and an
integer x the problem is to determine integer i, 0 ≤ i ≤ n, such that
1) 1 ≤ i ≤ n and i is the largest index such that x ≥ A[i], and
2)i = 0 if there is no such index.
Prologue: The source code implements modified search in an ordered array given as the input. It gives the resultant index as the output and number of comparisons made.
Overview: The program uses the file descr iptors to take input array from input file and to give the resultant index and comparisons onto an output file.
Given an ordered array A[1, n] of n ≥ 1 integers with A[1] ≤ A[2] ≤ · · · ≤ A[n], and an
integer x the problem is to determine integer i, 0 ≤ i ≤ n, such that
1) 1 ≤ i ≤ n and i is the largest index such that x ≥ A[i], and
2)i = 0 if there is no such index.
Prologue: The source code implements modified search in an ordered array given as the input. It gives the resultant index as the output and number of comparisons made.
Overview: The program uses the file descr iptors to take input array from input file and to give the resultant index and comparisons onto an output file.-Problem Statement:
Given an ordered array A[1, n] of n ≥ 1 integers with A[1] ≤ A[2] ≤ · · · ≤ A[n], and an
integer x the problem is to determine integer i, 0 ≤ i ≤ n, such that
1) 1 ≤ i ≤ n and i is the largest index such that x ≥ A[i], and
2)i = 0 if there is no such index.
Prologue: The source code implements modified search in an ordered array given as the input. It gives the resultant index as the output and number of comparisons made.
Overview: The program uses the file descr iptors to take input array from input file and to give the resultant index and comparisons onto an output file.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
msearch.c
mBsearch.c
mBsearch.c