Question

I need help writing this code in C++

Proj11.cpp is provided as well as the randomdata.txt

thank you in advance!

Objectives: The main objectives of this project is to introduce you to recursion, and test your ability to work with some STL functionalities. A review of your knowledge on working with templates, dynamic data structures, as well as manipulating dynamic memory, classes, pointers and iostream to all extents, is also included. Description: For the entirety of this project, you will work with STL std: :vectors. You are free to implement an y of the standard-provided functionalities with the libraries. For the first part of this you assignment, you will create three recursive functions: a) The vector resort Function (Recursive Sort) Parameters List Takes in a std: : vector by-Reference. Note that a std: :vector as part of the STL is a templated construct, hence the function will itself also need to be templated. Hint This is the base parameter requirement. Any parameters necessary for the function will depend on your specific implementation. Functionality: The function will have to perform Recursive Sorting of the vector elements. You may implement whichever sorting variant you wish (from the ones introduced in the Lab sections or any other established variant). Note: One of the most powerful naturally-recursive sorting Output: Nothing, since the std: :vector is passed by reference it should be sorted at the return of the vector resort function. b) The vector research Function Recursive Binary Search) Parameters List: Takes in a std: :vector by-Reference, which has to be already sorted. Note that a std: :vector as part of the STL is a templated construct, hence the function will itself also need to be templated. The function also takes in a const T& value, which is the one that is searched. Hint: These are the base parameter requirements, will depend on your specific implementation. Any other parameters necessary for the function Functionality: The function will have to perform Recursive Binary Search (ht for the provided value in the std: :vector. A Binary Search is performed as follows: Pick the value in the middle of the container (the pivot); if the search item is less than the pivot narrow the search to the bottom half of the container, otherwise search the top half of the container. This is done recursively until the item is found and the index (since std: :vectors can have index-based access) where it is found is returned. (Return -1 if the item is not found). inary search algorithm) as introduced during the class Lectures, Output: The index (since std: :vectors can have index-based access) where the value is found is returned. (Return -1 if the item is not found). Extra: You may also devise an implementation that returns std: :vector::iterator to the element in question (Return std: :vector: :end ) if the item is not found, not NULL -iterators are not generally pointers and should not be treated as such) For the second part of this assignment, you will implement the following functionalities: Create a vecInt, which will be std: :vector of ints, and fill it with 100 random int numbers which will be read from the provided file RandomData.txt. User input is not mandatory, and hard-coding the file name is allowed for this Project. (Note: If you wish to test with your own randomly ordered numbers, you may use std: :rand (http://en.cppreference.com/w/cpp/numeric/random/rand) to do this). Create a vecIntCpy, which will be another std: :vector of ints, which should be a copy of the previously created one. Apply vector resort and vector research on vecInt. Print out (only to terminal) the resulting vecInt. Extras (not required for 100pt grade): Try std: :sort and std: :binary search http://en.cppreference.com/w/cpp the vecIntcpy container. Time the difference between your implementation and the STL to perform the same tasks on one; you may perform high-resolution time-difference counting with (http://en.cppreference.com/w/cpp/chrono/high resolution clock/now) std: :chrono: :time pointcatd: :chrono: :aystem clock> tiatd::chrono::system clock::now ) //tasks to time... std: :chrono: :time point t2 std: :chrono: :system clock: now) std::chrono: :duration double> difft2-tl std: :cout

Answer 1

Please let me know if you have any doubts or you want me to modify the answer. And if you find this answer useful then don't forget to rate my answer as thumps up. Thank you! :)

//main.cpp

#include <iostream>
#include <fstream>

#include <vector>

#include "VectorRecursion.h"

int main(){

    std::vector<int> vecInt;

    std::ifstream fin("/Users/swapnil/CLionProjects/VectorRecursion/RandomData.txt");
    while(fin){
        int fin_in;
        fin >> fin_in;
        if (!fin)
            break;
        vecInt.push_back( fin_in );
    }

    for (size_t i=0; i<vecInt.size(); ++i){
        std::cout << vecInt[i] << " same as " << vecInt.at(i) << std::endl;
    }

    for (std::vector<int>::iterator it=vecInt.begin(); it!=vecInt.end(); ++it){
        std::cout << *it << std::endl;
    }

    return 0;
}

-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
//VectorRecursion.h

#ifndef VECTORRECURSION_VECTORRECURSION_H
#define VECTORRECURSION_VECTORRECURSION_H

#include <iostream>
#include <vector>

using namespace std;

template <typename T>
void swap(vector<T> &v, T m, T n) {
    T temp = v[m];
    v[m] = v[n];
    v[n] = temp;
}

template <typename T>
T divide(vector<T> &v, T l, T h) {
    T p = v[h];
    T r = l - 1;
    T s = l;
    while(s <= h - 1) {
        if(v[s] <= p) {
            ++r;
            swap(v, r, s);
        }
        ++s;
    }
    swap(v, r + 1, h);
    return (r + 1);
}

template <typename T>
void vector_resort(vector<T> &v, T l, T h) {
    if(l < h) {
        T p = divide(v, l, h);
        vector_resort(v, l, p - 1);
        vector_resort(v, p + 1, h);
    }
}

template <typename T>
T vector_research(vector<T> &v, T l, T h, const T theory) {
    if(l > h) {
        return -1;
    }
    T m = (l + h) / 2;
    if(v[m] == theory) {
        return m;
    }
    if(v[m] > theory) {
        return vector_research(v, l, m - 1, theory);
    }
    return vector_research(v, m + 1, h, theory);
}
#endif //VECTORRECURSION_VECTORRECURSION_H

Recursion] - ...main.cpp Project ▼ At ut..dk»奂:S main.cpP Rune /Users/swapnil/CLionProjects/VectorRecursion/cmake-build-debug/VectorRecursion 10 same as 10 O Event Log Terminal ㅿCMake 9: Messages 4: Run -6. T000 Process finished with exit code O 26:5 LF# UTF-8# 4 spaces# Context: VectorRecursioni

Recursion] - ...main.cpp main.cpp *증 *-ㅿCMakeLists.txt 분.main.cpp aRandomData txt VectorRecursionh Project ▼ Run: VectorRecursion 69 137 212 110 147 173 173 11e 115 212 281 17 21e Process finished with exit code 8 Q Event Log 四Terminal Process finished with exit code 0 İCMake 9: Messages 4:Run 0:T000 26:5 LF: UTF-8: 4 spaces 수 Context: