DSA lab: 27-Dec-21
Code implementation for:
1) Print hello world
#include <stdio.h>
int main()
{
printf("Hello World");
return 0;
}
2) Sum of two number
#include <stdio.h>
int sum(){
int num1, num2, sum;
printf("enter first number:");
scanf("%d", &num1);
printf("enter second number:");
scanf("%d", &num2);
sum = num1 + num2;
printf("sum is: %d", sum);
}
int main()
{
sum();
return 0;
}
3) Sum of array's elements
#include <stdio.h>
int main()
{
int sizeArr;
printf("Enter size of arr: ");
scanf("%d", &sizeArr);
int arr[sizeArr];
printf("Enter elements of arr: ");
for(int i=0;i<sizeArr;i++){
scanf("%d", &arr[i]);
}
int sum=0; // why initialized with 0?
for(int i=0; i<sizeArr; i++){
sum += arr[i];
}
printf("sum is %d", sum);
return 0;
}
4) Find the highest and lowest elements in an array
#include <stdio.h>
int main()
{
int sizeArr;
printf("Enter size of arr: ");
scanf("%d", &sizeArr);
int arr[sizeArr];
printf("Enter elements of arr: ");
for(int i=0;i<sizeArr;i++){
scanf("%d", &arr[i]);
}
int highest = arr[0];
int lowest = arr[0];
for(int i=1; i<sizeArr; i++){
if(highest<arr[i]){
highest = arr[i];
}
if(lowest> arr[i]){
lowest = arr[i];
}
}
printf("highest is : %d", highest);
printf("lowest is : %d",lowest);
return 0;
}
5) Merge two array
#include <stdio.h>
#include <stdbool.h>
bool isOdd(int num){
if(num%2 ==0){
return false;
}
return true;
}
// void display(int arr[]){
// }
int main()
{
int i, j, size1, size2, counter = 0, mergSize;
printf("Enter size of first array: ");
scanf("%d", &size1);
int arr1[size1];
printf("Enter elements of first array: ");
for(i=0; i<size1; i++){
scanf("%d", &arr1[i]);
}
printf("Enter size of second array: ");
scanf("%d", &size2);
int arr2[size2];
printf("Enter elements of second array: ");
for(i=0; i<size2; i++){
scanf("%d", &arr2[i]);
}
mergSize= size1+size2;
int mergedArr[mergSize];
for(i=0; i<size1; i++){
if(isOdd(arr1[i])){
mergedArr[counter] = arr1[i];
counter++;
}
}
for(i=0; i<size2; i++){
if(isOdd(arr2[i])){
mergedArr[counter] = arr2[i];
counter++;
}
}
for(i=0; i<size1; i++){
if(!isOdd(arr1[i])){
mergedArr[counter] = arr1[i];
counter++;
}
}
for(i=0; i<size2; i++){
if(!isOdd(arr2[i])){
mergedArr[counter] = arr2[i];
counter++;
}
}
for(i=0; i<mergSize; i++){
printf("Element at position %d is: %d \n", i , mergedArr[i]);
}
return 0;
}
Comments
Post a Comment