Exercises The first 25 exercises should all have one-line solutions using map, f

Question

Exercises The first 25 exercises should all have one-line solutions using map, foldr, or foldl. You can also use other predefined functions, of course, but do not write any additional named functions and do not use explicit recursion. If you need helper func- tions, use anonymous ones. For example, if the problem says "write a function add2 that takes an int list and returns the same list with 2 added to every ele- ment," your answer should be fun add2 x- map (fn a a 2) x; You have seen some of these problems before. The trick now is to solve the new, concise form. m in this

Explanation / Answer

Solution for Exercise 2 (C++):-

Program :-

#include<iostream>
#include<string>
using namespace std;
int* ordlist(string str1)
{
int *arr,len=str1.length();
for(int i=0;i<len;i++)
{
arr[i]=(int)str1[i];
}
return arr;
}
int main()
{
string str;
cin>>str;
int* arra=ordlist(str);
for(int i=0;i<str.length();i++)
cout<<arra[i]<<" ";
return 0;
}

Output :-

AbcGA
65 98 99 71 65

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.