Question
For this assignment you will make a Vehicle class with two recursive member functions. a) Implement overloaded member functions called binSearchRec ,the recursive binSearchRec algorithm
For this assignment you will make a Vehicle class with two recursive member functions.
a) Implement overloaded member functions called binSearchRec,the recursive binSearchRec algorithm is presented in this chapter, starting on page 68 for an array of vehicles. Use a vector instead of an array.
- Sort by make then call a recursive function to do a binary search which lists out the make, model and year for the first year found (or report accordingly) that matches the for a user input.
then start a new sort
- Sort by model then call a recursive function to do a binary search which lists out the make, model and year for the first year found (or report accordingly) that matches the for a user input.
Read in the vehicles from a vehicle file (vehiclein.txt) that has a year, make, and model. You have a choice of reading in an integer and two strings OR reading in 3 strings and converting the year to an int. Remember that between a stream operator (
b) Implement a member function with the same functional requirements, except instead of a recursive member function, use an iterative (non-recursive) binarySearchIter. Your iterative function (with loops instead of recursion) should produce the same results as your recursive function. You can place this member function in your recursion.h and recursion.cpp files.
use this TXT FILE:-
2010 Ford Escape 2014 BMW 328xi 2014 BMW 428xi 2012 Ford Fusion SE 2014 Lamborghini Gallardo 1967 Pontiac GTO 1983 DeLorean DMC-12 1990 Audi 80 Sedan
USE C++ Language
Arrays are not allowed please use only VECTORS and CLASS
i need 4 files namely main.cpp, vechicle.cpp, vehicle.h and vehiclein.txt
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started