#include <stdio.h>
#include <string.h>
int main(void) {
printf("Hello World!\n");
return 0;
}
/*
int mergeSortedArray(int arr1[],int len1,int arr2[],int len2)
{
int arrItem1 = arr1[0];
int arrItem2 = arr2[0];
int i=1;
int j=1;
int arrMrg[7],mrgIdx=0;
while ( mrgIdx < len1 + len2 )
{
if (arrItem1<arrItem2 || arrItem2 == '\0')
{
arrMrg[mrgIdx]=arrItem1;
arrItem1=arr1[i];
i++;
mrgIdx++;
}
else{
arrMrg[mrgIdx]=arrItem2;
arrItem2=arr2[j];
j++;
mrgIdx++;
}
}
printf("Merged Array is :\n");
for (int x=0;x<7;x++)
printf(" %d ",arrMrg[x]);
}
int main () {
int arr1[4]={0,3,4,31} , arr2[3]={4,6,30};
mergeSortedArray(arr1,4,arr2,3);
return 0;
}
char revStr[] = "Hi My Name is Andrei" ;
int len = strlen (revStr);
char temp;
printf("Lenth is %d",len);
for ( int i =0; i < len/2 ; i++){
printf(" i is %c , char %c\n",revStr[i],revStr[len - i]);
temp = revStr[i];
revStr[i] = revStr[len - i - 1];
revStr[len - i - 1] = temp;
}
printf("Rev string is %s",revStr);
return 0;
}
#include <stdio.h>
#include <stdbool.h>
int pairHasSum(int arr[],int sum,int length)
{
bool mySet[100] = {false};
printf("Array length is %d \n" ,length );
for(int i =0 ;i< length ;i++){
// Check elements is array has diff of sum - previous number
if (mySet[arr[i]])
{
printf("Found 2nd number %d , against number %d in previous indices \n" , arr[i] , sum - arr [i]);
}
// Add elements as true for sum - number in array
mySet[ sum - arr [i] ] = true;
}
return 0;
}
int main(void) {
printf("Hello World!\n");
// Array where index represents the number
int arr[] = {1,2,6,4};
int length = sizeof(arr) / sizeof(arr[0]);
pairHasSum (arr,8,length);
return 0;
}
#include <stdio.h>
#include <stdbool.h>
int pairHasSum(int arr[],int sum,int length)
{
printf("Array length is %d \n" ,length );
for ( int i=0; i < length - 1; i++){
for ( int j= i +1 ; j< length ; j++){
printf("i = %d , j = %d , sum is %d \n" , arr[i] , arr[j] , (arr[i] + arr[j]));
if( arr[i] + arr[j] == sum)
return 1;
else if ( j == length)
return 5;
}
}
return 0;
}
int main(void) {
printf("Hello World!\n");
int arr[] = {4,2,3,3};
int length = sizeof(arr) / sizeof(arr[0]);
int result = pairHasSum (arr,8,length);
if (result == 1)
printf("\nFound");
else
printf("Not found");
return 0;
}
*/
