Use the given code to Integer Functions: 1. find – Accepts an integer array, its length, and a integer value to find. It returns true if value exists in the array. Otherwise it returns false if not found. 2. isSorted – Accepts an integer array and length. It determines if it is sorted in ascending numeric order. Returns true, if it is sorted or false if it is not. 3. mean – Accepts a float vector. This function returns the mean of the elements of the vector. Return 0 if the vector is empty. 4. stddev – Given a float array and its length, return the population standard deviation as a double (
View complete question »Use the given code to Integer Functions: 1. find – Accepts an integer array, its length, and a integer value to find. It returns true if value exists in the array. Otherwise it returns false if not found. 2. isSorted – Accepts an integer array and length. It determines if it is sorted in ascending numeric order. Returns true, if it is sorted or false if it is not. 3. mean – Accepts a float vector. This function returns the mean of the elements of the vector. Return 0 if the vector is empty. 4. stddev – Given a float array and its length, return the population standard deviation as a double (divide by N not N-1). Return 0.0 if the array is empty. You may want use mean() function above. 5. removeDups – Accepts an int vector and returns a new vector. This function should return a new vector with all duplicate elements removed. 6. reverse – Accepts an integer vector. This function flips the order, so the first element becomes the last and the last, the first, etc. Returns nothing , but the provided vector will be changed. Should work for ANY sized vector. String Functions: 1. countUpperCaseChars – Given a string, return the number of uppercase characters. Use isupper from the cctype library. 2. convertToUpper – Given an input string convert all alphabetic characters to uppercase. Return a new string converted to uppercase. If the input string is empty just return the input string. 3. removeSpaces – Given an input string remove all spaces from this string. Return a new string with spaces removed. If the input string is empty return the original string. 4. numWords – Given a string, return the number of words it contains. A word is defined to be a sequence of alphabetic (isalpha) characters with non-alphabetic characters on each side. If alphabetic characters start or end the string, they are considered a word. The best method to solve this is to use the isalpha function to determine the beginning and end of each string. 5. characterCounts – Given a string, return a vector of ints of length 26 containing the number of times each letter was seen. Index 0 corresponds to a, 1 to b, etc Treat upper-case letters as lower-case. #include #include #include #include #include #include #include #include using namespace std; bool find(int array[], int length, int value){ // TODO: Fill me in } bool isSorted(int array[], int length){ // TODO: Fill me in } void reverse(vector &reverse_me) { // TODO: Fill me in } float mean(const vector values) { // TODO: Fill me in } float stddev(const vector values) { // TODO: Fill me in // Should use mean above } vectorremoveDups(vectorarray){ // TODO: Fill me in // This is just to keep the compiler happy return vector(); } // Strings unsigned int countUpperCaseChars(const string &countme){ // TODO: Fill me in } unsigned int numWords(const string &countme){ // TODO: Fill me in } string convertToUpper(const string &to_be_converted){ // TODO: Fill me in } string removeSpaces(const string &remove_from_me){ // TODO: Fill me in } vector characterCounts(const string &countme){ // TODO: Fill me in } template string print(vectorvec); template string print(T array[], int length); int main(){ srand(time(0)); cout < int x1[10] = {1,2,3,5,5,6,7,8,9,0}; cout cout cout cout cout cout cout cout cout < vector v1 = {1,2,3,4,5}; reverse(v1); cout reverse(v1); cout vector v2 = {5}; cout vector v3 = {1,2,4,5}; reverse(v3); cout vector v4(100); v4[0] = 4; v4[1] = 2; reverse(v4); cout cout cout cout< vector f1 = {1.2, 2.4, 3.4}; vector f2 = {5.6, 5.6, 5.6, 5.6, 5.6, 5.6}; cout cout cout< cout cout cout< vector v5; v5.push_back(1); v5.push_back(2); v5.push_back(3); v5.push_back(3); v5.push_back(4); v5.push_back(5); v5.push_back(1); vector v12 = removeDups(v5); cout cout vector v6; for(int i = 0; i v6.push_back(i%17 + i %7); } vector v22 = removeDups(v6); cout cout < string upper_test = "aaABCdeFG"; cout < cout cout< cout< string no_upper_case = "aaaa"; cout cout < string test1 = "aa AB Cd e FG"; string test2 = "aaAB Cd e FG "; string test3 = " rrAB Cd e FG"; string test4 = " rrAB Cd e FG "; cout cout cout cout return 0; } // A sneaky way to allow 1 function to print any typed array, as long as // the passed array element can be sent to < // The stringstream allows us to 'print' information to a fake output // stream, and then get the result as a string. It's a simple way of // getting a non-string/character into a string. // Contense of this function will not be tested in this course! template string print(vectorvect) { stringstream out; out < for(int i = 0; i out < if(i != vect.size()-1)out < } out < return out.str(); } template string print(T array[], int length){ stringstream out; out < for(int i = 0; i out < if(i != length-1)out < } out < return out.str(); } View less »
Why Work with Us
Top Quality and Well-Researched Papers
We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.
Professional and Experienced Academic Writers
We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.
Free Unlimited Revisions
If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.
Prompt Delivery and 100% Money-Back-Guarantee
All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.
Original & Confidential
We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.
24/7 Customer Support
Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.
Our Services
No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.
Essays
No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.
Admissions
Admission Essays & Business Writing Help
An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.
Reviews
Editing Support
Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.
Reviews
Revision Support
If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.