In C++ language For each function be sure to include the date and a great sentence describing the goal of the function. Be sure to use great variable names. Don’t use 30 lines of code when you can solve the problem elegantly with only 5. Include code in your main showing that all your functions work correctly. Note I want you to write code to do this assignments, not simply call a built-in gadget. Built-in min and max gadgets are useful, but computer scientists get paid more money because they can write such gadgets, not simply shove numbers into a black box.\ 4. Write a function that accepts a string s, and returns a count of the number of characters in s that have ascii values between ‘a’ and ‘z’ inclusive or between ‘A’ and ‘Z’ inclusive, in other words an upper or lower case letter. Use if-then-else statements, not a built-in letter gadget). 5. Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a. 6. Write a function that counts the number of times an integer t occurs in an array of integers. 7. Write a void function that accepts an integer array a and a integer SizeA, and an integer n, and adds n to every element in that array. Be sure to develop an appropriate name for your function. 8. Write a function method that determines the mean of all the values in an array of integers. Your mean function should call a separate function that you write that determines the sum. Don’t use built-in sum or mean gadgets, but roll your own. 9. Implement a bubble sort that accepts an array of integers a, and an integer aSize, and sorts a in DECENDING order. Determine the execution speed for your bubble sort as the array length increases from 100 to 1000, 10000, 100000, and 250000 elements. Use the attached code fragment to time your bubbleSort function. Place a brief, but well-written summary of your results
In C++ language
For each function be sure to include the date and a great sentence describing the goal of the function. Be sure to use great variable names. Don’t use 30 lines of code when you can solve the problem elegantly with only 5. Include code in your main showing that all your functions work correctly. Note I want you to write code to do this assignments, not simply call a built-in gadget. Built-in min and max gadgets are useful, but computer scientists get paid more money because they can write such gadgets, not simply shove numbers into a black box.\
4. Write a function that accepts a string s, and returns a count of the number of characters in s that have ascii values between ‘a’ and ‘z’ inclusive or between ‘A’ and ‘Z’ inclusive, in other words an upper or lower case letter. Use if-then-else statements, not a built-in letter gadget).
5. Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a.
6. Write a function that counts the number of times an integer t occurs in an array of integers.
7. Write a void function that accepts an integer array a and a integer SizeA, and an integer n, and adds n to every element in that array. Be sure to develop an appropriate name for your function.
8. Write a function method that determines the mean of all the values in an array of integers. Your mean function should call a separate function that you write that determines the sum. Don’t use built-in sum or mean gadgets, but roll your own.
9. Implement a bubble sort that accepts an array of integers a, and an integer aSize, and sorts a in DECENDING order. Determine the execution speed for your bubble sort as the array length increases from 100 to 1000, 10000, 100000, and 250000 elements. Use the attached code fragment to time your bubbleSort function.
Place a brief, but well-written summary of your results
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images
