Answer is Highlighted in Red. I don\'t understand why it is the answer so can you ste by step explain what each part of the code is doing?
Solution
#include<iostream>
#include<string>
using namespace std;
public bool isPermutation(String str1,String str2) {
if(str1.size()!= str2.size()) return false;
else continue;
int i,counts[10];
for(i =0;i<str1.size();i++)
counts[str1[i] –‘0’] ++;   //Increment the least significant bit
for(i=0;i<str2.size();i++)
counts[str2[i] – ‘0’]--;  // decrement the least significant bit
for(i=0;i<10;i++) {
if(counts[i]!=0) return false;Â Â // if any count is different ,it is not a permutation
else return true;Â Â // counts are identical, was a permutation
}
}
int main() {
String s1,String s2;
cout << “enter string1â€;
cin>>s1;
cout<<end1;
cout << “Enter string2â€;
cin>>s2;
cout<<end1;
isPermutation(s1,s2);
if(isPermutation(s1,s2)) {
cout<<â€Strings are permutations†<<end1;
else cout <<â€Strings are not Permutations†<< end1;
}
return 0;
}
.
Answer is Highlighted in Red- I don-'t understand why it is the answer (1).docx
1. Answer is Highlighted in Red. I don't understand why it is the answer so can you ste by step
explain what each part of the code is doing?
Solution
#include<iostream>
#include<string>
using namespace std;
public bool isPermutation(String str1,String str2) {
if(str1.size()!= str2.size()) return false;
else continue;
int i,counts[10];
for(i =0;i<str1.size();i++)
counts[str1[i] –‘0’] ++;   //Increment the least significant bit
for(i=0;i<str2.size();i++)
counts[str2[i] – ‘0’]--;  // decrement the least significant bit
for(i=0;i<10;i++) {
if(counts[i]!=0) return false;Â Â // if any count is different ,it is not a permutation
else return true;Â Â // counts are identical, was a permutation
}
}
2. int main() {
String s1,String s2;
cout << “enter string1―;
cin>>s1;
cout<<end1;
cout << “Enter string2―;
cin>>s2;
cout<<end1;
isPermutation(s1,s2);
if(isPermutation(s1,s2)) {
cout<<â€Strings are permutations†<<end1;
else cout <<â€Strings are not Permutations†<< end1;
}
return 0;
}
![Answer is Highlighted in Red. I don't understand why it is the answer so can you ste by step
explain what each part of the code is doing?
Solution
#include<iostream>
#include<string>
using namespace std;
public bool isPermutation(String str1,String str2) {
if(str1.size()!= str2.size()) return false;
else continue;
int i,counts[10];
for(i =0;i<str1.size();i++)
counts[str1[i] –‘0’] ++;   //Increment the least significant bit
for(i=0;i<str2.size();i++)
counts[str2[i] – ‘0’]--;  // decrement the least significant bit
for(i=0;i<10;i++) {
if(counts[i]!=0) return false;Â Â // if any count is different ,it is not a permutation
else return true;Â Â // counts are identical, was a permutation
}
}](https://image.slidesharecdn.com/answerishighlightedinred-idon-tunderstandwhyitistheanswer1-230204001639-abbd82fc/85/Answer-is-Highlighted-in-Red-I-don-t-understand-why-it-is-the-answer-1-docx-1-320.jpg)
