Cs 20a c data structures assignment in this assignment you

Question

Data Structures Assignment: Searching Lists: Sequential, Binary, and Fibonacci Searches

In this assignment, you will implement three search algorithms: sequential, binary, and Fibonacci.

Please download the starter files for this assignment from the Files tab. For each algorithm, provide an explanation of its time complexity.  Do not alter the function definition or driver code in any way. Programs that crash are subject to a 50% penalty. PLEASE NOTE: You may not use any Standard Template Library (STL) classes for this assignment.

1. Implement the Sequential Search Algorithm

template

int sequential_search (T array[], int size, T value); 

The sequential search algorithm finds the location of an item in an array, sorted or unsorted. 

2. Implement the Recursive and Non-Recursive Binary Search Algorithms

template

int binary_searchR(T array[], int first, int last, T value);

template

int binary_searchNR(T array[], int first, int last, T value); 

The binary search algorithm finds the location of an item in a sorted array.  The binary search algorithm compares a search key to the middle element in a sorted array.

1. If the search key equals the middle element, return the index of the element.

2. If the search key is greater than the middle element, continue searching in the right half of the array.

3. If the search key is less than the middle element, continue searching in the left half of the array.

4. If the search key is not found (first > last), return -1.

3. Implement the Fibonacci Search Algorithm

template

int fibonacci_search (T array[], int size, T value);

Let k be defined as an element in F, the array of Fibonacci numbers. n = Fm is the array size. If the array size is not a Fibonacci number, let Fm be the smallest number in F that is greater than n.

The array of Fibonacci numbers is defined where F_k+2 = F_k+1 + F_k, when k ≥ 0, F₁ = 1, and F₀ = 0.

To test whether an item is in the list of ordered numbers, follow these steps:

1. Set k = m.

2. If k = 0, stop. There is no match; the item is not in the array.

3. Compare the item against element in F_k-1.

4. If the item matches, stop.

5. If the item is less than entry F_k-1, discard the elements from positions F_k-1 + 1 to n. Set k = k - 1 and return to step 2.

6. If the item is greater than entry F_k-1, discard the elements from positions 1 to F_k-1. Renumber the remaining elements from 1 to F_k-2, set k = k - 2, and return to step 2.

Attachment:- Assignment File.zip