代码搜索：sequential
找到约 1,846 项符合「sequential」的源代码
代码结果 1,846
www.eeworm.com/read/372507/9507293
cpp ssearch2.cpp
// sequential search
#include
template
int SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position if found; return
www.eeworm.com/read/372507/9507304
cpp ssearch1.cpp
// sequential search
#include
template
T SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position if found; return -1
www.eeworm.com/read/372507/9507347
cpp ssearch3.cpp
// sequential search of sorted array
#include
template
int SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position i
www.eeworm.com/read/364078/9922190
readme
Usage:
./prefixspan [options] < data
option:
-m NUM: set minimum support (default 1)
-M NUM: set minimum pattern length (default 1)
-s: use STR
www.eeworm.com/read/168218/9932102
cpp ssearch2.cpp
// sequential search
#include
template
int SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position if found; return
www.eeworm.com/read/168218/9932215
cpp ssearch1.cpp
// sequential search
#include
template
int SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position if found; return
www.eeworm.com/read/168218/9932960
cpp ssearch3.cpp
// sequential search of sorted array
#include
template
int SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position i
www.eeworm.com/read/168218/9933544
cpp ssearch2.cpp
// sequential search
#include
template
int SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position if found; return
www.eeworm.com/read/168218/9933554
cpp ssearch1.cpp
// sequential search
#include
template
int SequentialSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
// Return position if found; return