a) Implement a function that uses recursion to print odd-indexed elements from a given vector. Usethe following function template. [10 pts]#include #include void printodd(const std::vector& arr, int index = 0){//to do…}b) What is the time complexity of this approach? Explain [5 pts]
Read DetailsWrite a program that allows a user to perform text editing with Undo/Redo functionality which allows the user to specify how many steps to undo or redo at once. Example template- #include #include using namespace std; class TextEditor {private: struct Node { string content; Node* prev; Node* next; Node(const string& text) : content(text), prev(nullptr), next(nullptr) {} }; Node* current; public: TextEditor() { current = new Node(“”); } ~TextEditor() { while (current->prev != nullptr) { current = current->prev; } while (current != nullptr) { Node* temp = current; current = current->next; delete temp; } } void type(const string& text) { //to do… } void undo(int steps) { //to do.. } void redo(int steps) { //to do.. } } string getCurrentText() const { return current->content; }}; Example usage- nt main() { TextEditor editor; // Test Case 1: Adding initial text editor.type(“Hello “); cout
Read Details