Login/RegisterProgram Discussion :: Array
77 / 30
Write a program to merge two sorted array.
Answer:
#include
#include
using namespace std;
void main()
{
int array1[50], array2[50], array3[100], m, n, i, j, k = 0;
coutm;
coutarray1[i];
}
coutn;
coutarray2[i];
}
i = 0;
j = 0;
while (i < m && j < n)
{
if (array1[i] < array2[j])
{
array3[k] = array1[i];
i++;
}
else
{
array3[k] = array2[j];
j++;
}
k++;
}
if (i >= m)
{
while (j < n)
{
array3[k] = array2[j];
j++;
k++;
}
}
if (j >= n)
{
while (i < m)
{
array3[k] = array1[i];
i++;
k++;
}
}
cout
Asked In ::
Language:
Varun Singh
24 Jun, 2017 5:37 PM
<!DOCTYPE html>
<html>
<body>
<?php
function Merge()
{
$L = array(
1,
3,
4,
6
);
$R = array(
2,
5,
16
);
$arr = array();
$n1 = count($L);
$n2 = count($R);
echo "1st sorted array is: ";
for ($x = 0; $x < $n1; $x++)
echo $L[$x] . "\t";
echo "<br/ >2nd sorted array is: ";
for ($x = 0; $x < $n1; $x++)
echo $L[$x] . "\t";
$i = 0;
$j = 0;
$k = 0;
while (($i < $n1) && ($j < $n2)) {
if ($L[$i] <= $R[$j]) {
$arr[$k] = $L[$i];
$i++;
} else {
$arr[$k] = $R[$j];
$j++;
}
$k++;
}
while ($i < $n1) {
$arr[$k] = $L[$i];
$i++;
$k++;
}
while ($j < $n2) {
$arr[$k] = $R[$j];
$j++;
$k++;
}
$arrlength = count($arr);
echo " <br/>Sorted Array is : ";
for ($x = 0; $x < $arrlength; $x++)
echo $arr[$x] . "\t";
}
Merge();
?>
</body>
</html>
Language:
Ajay
7 Jul, 2017 9:30 AM
#include <stdio.h>
void main()
{
int array1[50], array2[50], array3[100], m, n, i, j, k = 0;
printf("\n Enter size of array Array 1: ");
scanf("%d", &m);
printf("\n Enter sorted elements of array 1: \n");
for (i = 0; i < m; i++)
{
scanf("%d", &array1[i]);
}
printf("\n Enter size of array 2: ");
scanf("%d", &n);
printf("\n Enter sorted elements of array 2: \n");
for (i = 0; i < n; i++)
{
scanf("%d", &array2[i]);
}
i = 0;
j = 0;
while (i < m && j < n)
{
if (array1[i] < array2[j])
{
array3[k] = array1[i];
i++;
}
else
{
array3[k] = array2[j];
j++;
}
k++;
}
if (i >= m)
{
while (j < n)
{
array3[k] = array2[j];
j++;
k++;
}
}
if (j >= n)
{
while (i < m)
{
array3[k] = array1[i];
i++;
k++;
}
}
printf("\n After merging: \n");
for (i = 0; i < m + n; i++)
{
printf("\n%d", array3[i]);
}
}
Language:
Varuna Rai
7 Jul, 2017 9:30 AM
#include <stdio.h>
#include <iostream>
using namespace std;
void main()
{
int array1[50], array2[50], array3[100], m, n, i, j, k = 0;
cout<<"\n Enter size of array Array 1: ";
cin>>m;
cout<<"\n Enter sorted elements of array 1: \n";
for (i = 0; i < m; i++)
{
cin>>array1[i];
}
cout<<"\n Enter size of array 2: ";
cin>>n;
cout<<"\n Enter sorted elements of array 2: \n";
for (i = 0; i < n; i++)
{
cin>>array2[i];
}
i = 0;
j = 0;
while (i < m && j < n)
{
if (array1[i] < array2[j])
{
array3[k] = array1[i];
i++;
}
else
{
array3[k] = array2[j];
j++;
}
k++;
}
if (i >= m)
{
while (j < n)
{
array3[k] = array2[j];
j++;
k++;
}
}
if (j >= n)
{
while (i < m)
{
array3[k] = array1[i];
i++;
k++;
}
}
cout<<"\n After merging: \n";
for (i = 0; i < m + n; i++)
{
cout<<"\n"<<array3[i];
}
}
Language:
Varuna Rai
7 Jul, 2017 9:30 AM
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
using namespace std;
#define bool int
struct sNode
{
char data;
struct sNode *next;
};
void push(struct sNode** top_ref, int new_data);
int pop(struct sNode** top_ref);
bool isMatchingPair(char character1, char character2)
{
if (character1 == '(' && character2 == ')')
return 1;
else if (character1 == '{' && character2 == '}')
return 1;
else if (character1 == '[' && character2 == ']')
return 1;
else
return 0;
}
bool areParenthesisBalanced(char exp[])
{
int i = 0;
struct sNode *stack = NULL;
while (exp[i])
{
/*If the exp[i] is a starting parenthesis then push it*/
if (exp[i] == '{' || exp[i] == '(' || exp[i] == '[')
push(&stack, exp[i]);
/* If exp[i] is an ending parenthesis then pop from stack and
check if the popped parenthesis is a matching pair*/
if (exp[i] == '}' || exp[i] == ')' || exp[i] == ']')
{
/*If we see an ending parenthesis without a pair then return false*/
if (stack == NULL)
return 0;
/* Pop the top element from stack, if it is not a pair
parenthesis of character then there is a mismatch.
This happens for expressions like {(}) */
else if ( !isMatchingPair(pop(&stack), exp[i]) )
return 0;
}
i++;
}
/* If there is something left in expression then there is a starting
parenthesis without a closing parenthesis */
if (stack == NULL)
return 1; /*balanced*/
else
return 0; /*not balanced*/
}
/* UTILITY FUNCTIONS */
/*driver program to test above functions*/
int main()
{
char exp[100] = "{()}[]";
if (areParenthesisBalanced(exp))
cout<<"\n Balanced ";
else
cout<<"\n Not Balanced ";
return 0;
}
/* Function to push an item to stack*/
void push(struct sNode** top_ref, int new_data)
{
/* allocate node */
struct sNode* new_node =(struct sNode*) malloc(sizeof(struct sNode));
if (new_node == NULL)
{
cout<<"Stack overflow \n";
getchar();
exit(0);
}
/* put in the data */
new_node->data = new_data;
/* link the old list off the new node */
new_node->next = (*top_ref);
/* move the head to point to the new node */
(*top_ref) = new_node;
}
/* Function to pop an item from stack*/
int pop(struct sNode** top_ref)
{
char res;
struct sNode *top;
/*If stack is empty then error */
if (*top_ref == NULL)
{
cout<<"Stack overflow \n";
getchar();
exit(0);
}
else
{
top = *top_ref;
res = top->data;
*top_ref = top->next;
free(top);
return res;
}
}
Language:
Chinnu
29 Dec, 2021 8:31 PM
demo class{
public static void main(Strings []args){
System.out.println("hello");
}
}
Language:
Chinnu
29 Dec, 2021 8:31 PM
demo class{
public static void main(Strings []args){
System.out.println("hello");
}
}
Language:
Vinny
12 Apr, 2022 12:07 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:07 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:08 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:09 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:09 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:09 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:09 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
Language:
Vinny
12 Apr, 2022 12:09 PM
import java.util.*;
import java.io.*;
class mergeary{
public static void main(String args[])throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter first array size");
int m=Integer.parseInt(br.readLine());
int[] a=new int[m];
System.out.println("enter elements:");
for(int i=0;i<m;i )
{
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("enter second array size");
int n=Integer.parseInt(br.readLine());
int[] b=new int[n];
System.out.println("enter elements:");
for(int i=0;i<n;i )
{
b[i]=Integer.parseInt(br.readLine());
}
Arrays.sort(a);
Arrays.sort(b);
int[] c=new int [m n];
for(int i=0;i<m;i )
{
c[i]=a[i];
}
for(int i=0;i<n;i )
{
c[i m]=b[i];
}
Arrays.sort(c);
System.out.println("our array");
for(int i=0;i<m n;i )
{
System.out.println(c[i] " ");
}
}
}
