#include<iostream>
using namespace std;
void process1(char str[])
{
int i=0;
while(str[i]!='\0')
{
if(str[i]>=65 and str[i]<=90)
{
str[i]=str[i]+32;
}
i++;
}
}
void process2(char str[])
{
int i=0;
while(str[i]!='\0')
{
if(str[i]>=97 and str[i]<=122)
{
str[i]=str[i]-32;
}
i++;
}
}
void check(char str[])
{
int i=0,count=0,count1=0;
while(str[i]!='\0')
{
if(str[i]>=65 and str[i]<=90)
{
count++;
}
else if(str[i]>=97 and str[i]<=122)
{
count1++;
}
i++;
}
if(count1==count)
process1(str);
else if(count1<count)
process2(str);
else if(count1>count)
process1(str);
}
int main()
{
char str[101];
cin>>str;
check(str);
cout<<str;
return 0;
}
//bubble sort algorithm in c++ #include<bits/stdc++.h> using namespace std; void bubble_sort(int arr[],int n) { int i,j; for(i=1;i<n;i++) { for(j=0;j<n-i;j++) { if(arr[j]>arr[j+1]) { swap(arr[j],arr[j+1]); //swap is an inbuilt function } } } //time complexity is O(n^2) } int main() { int n,i; cout<<"Enter the number of elements of the array"<<endl; cin>>n; int arr[n]; for(i=0;i<n;i++) { ...
Comments
Post a Comment