Topic: Sequential Search
Not finding your answer? Try searching the web for Sequential Search
Answers to Common Questions
What is sequential search?
( si′kwen·chəl ′sərch ) (computer science) A procedure for searching a table that consists of starting at some table position (usually the beginning) and comparing the file-record key in hand with each table-record key, one at a time, until... Read More »
Source: http://www.answers.com/topic/sequential-search
What is binary search and sequential search?
A Binary Searchis a technique for quickly locating an item in a sequential list. A Sequential Searchis a procedure for searching a table that consists of starting at some table position (usually the beginning) and comparing the file-record ... Read More »
Source: http://wiki.answers.com/Q/What_is_binary_search_and_sequential_se...
What is the average number of comparisons in a sequential search?
If this is a homework related question, you really should consider trying to solve it yourself before looking at this answer. Otherwise, the value of the lesson, and the reinforcement provided by the assignment, will be lost to you. In a se... Read More »
Source: http://wiki.answers.com/Q/What_is_the_average_number_of_compariso...
Featured Content:
Sequential Search
More Common Questions
Answers to Other Common Questions
The simplest searching technique is the sequential(linear) search. The advantage of the sequential search is its simplicity. You begin at the beginning of the list and search for the desired value or record by examining each subsequent valu...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20080513105219AA2yxw6
When the list is small the sequential search is faster than a binary search. With a large list the binary search wins the race. A binary search requires the list to be in sort order, a sequential search does not. A sequential search is a br...
Read More »
Source: http://wiki.answers.com/Q/What_are_the_short_comings_of_a_binary_...
Are you incapable of using Google or what ? Try here ---> http://citeseer.ist.psu.edu/491765.html
Read More »
Source: http://answers.yahoo.com/question/index?qid=20060905031348AA6KHh5
If you're strictly using a sequential search, then the order of the array's content will make no difference. Whether it's in low-high order, high-low order, or randomized, the time complexity for a sequential search will remain O(n).
Read More »
Source: http://wiki.answers.com/Q/How_can_the_content_of_the_array_be_rec...
u have to get the search algorithm and code it in Java , here's the algorithm Get the array to search Get the element to be search ( the key ) While ( the key is not found and it's not the end of the array ) : Get the current index Get the ...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20090208142625AA4cQnW
it means in order (from 1 to n) sequential is for elements of an array as is chronological for the years we lived up till now :) example: you could have sequential search, that takes something like for (i=0;i<n;i++) if (a[i]==element_we_sea...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20091130004844AAKFiA4
