Skip to main content

Show address of each character in string


#include<iostream>
#include<string>

using namespace std;

void main()
{
string s1,s2;
string s3;

cout<<"\n\n Enter first string: ";
cin>>s1;
cout<<"\n\n Enter second string: ";
cin>>s2;

//  Address of each character in the strings s1, s2;
for(unsigned i=0,j=0;i<((s1.length()>s2.length())?s1.length():s2.length());i++,j++)
{
if(i<s1.length())
cout<<"\n Address of s1("<<s1[i]<<") = "<<(int)&s1[i];

if(i<s2.length())
cout<<"\t Address of s2("<<s2[j]<<") = "<<(int)&s2[j];
}

system("pause");
}

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};