arr1 = [1, 3, 5, 7];
arr2 = [2, 6, 10];
p1 = arr1.length;
p2 = arr2.length;
n = p1+p2;
if (n == 0)
n--;
med = 0;
p1--;
p2--;
while (0 < n) {
if (p2 < 0 || (p1 >= 0 && arr1[p1] > arr2[p2]))
med = arr1[p1--];
else
med = arr2[p2--];
n -= 2;
}
if (0 == n) {
if (p2 < 0 || (p1 >= 0 && arr1[p1] > arr2[p2]))
med = med+arr1[p1];
else
med = med+arr2[p2];
med /= 2;
}
console.log(med);
var arr1 = [1, 3, 5, 7];
arr2 = [2, 6, 10];
var counter1 = 0;
counter2 = 0;
counter3 = 0;
counter4 = 0;
counter5 = (arr1.length + arr2.length) / 2;
endCounter = 0;
totalCounter = 0;
for(; totalCounter < Math.round(counter5); totalCounter++){
counter4 = counter3;
if(arr1[counter1] <= arr2[counter2]) {
counter3 = arr1[counter1];
counter1++;
} else {
counter3 = arr2[counter2];
counter2++;
};
};
if(counter5 != Math.round(counter5)){
endCounter = (counter3 + counter4) / 2;
} else {
endCounter = counter3;
};#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
void bubble_sort(int *a, int array_size) {
for (int i = 0; i < array_size - 1; i++) {
for (int j = 0; j < array_size - i - 1; j++) {
if (a[j] > a[j+1]) {
int save;
save = a[j];
a[j] = a[j + 1];
a[j + 1] = save;
}
}
}
}
int main() {
srand(time(0));
int a_s;
int b_s;
int answer;
cout << "Enter the size of the first array: ";
cin >> a_s;
cout << endl;
cout << "Thx. Now, the second array: ";
cin >> b_s;
if (((a_s + b_s) % 2) == 0) {
b_s = b_s + 1;
cout << "First and second sizes are even. We'll add 1 point to size of second array. ";
}
cout << endl;
cout << "===================================";
cout << endl;
cout << "Random values or input from keyboard? (1/2, yeap, i'm very lazy to use strcmp() :) ";
cin >> answer;
cout << "===================================";
cout << endl;
int *a = new int[a_s];
int *b = new int[b_s];
cout << "All values will be automatically sorted in ASC order!" << endl;
cout << "Warning! Don't type the same numbres! The middle values also will be counted!!" << endl;
cout << endl;
if (answer == 1) {
for (int i = 0; i < a_s; i++) {
a[i] = rand() % 10 + 1;
}
for (int i = 0; i < b_s; i++){
b[i] = rand() % 16 + 1;
}
}
else if(answer == 2) {
for (int i = 0; i < a_s; i++) {
cout << "a[" << i + 1 << "]: ";
cin >> a[i];
}
for (int i = 0; i < b_s; i++) {
cout << "b[" << i + 1 << "]: ";
cin >> b[i];
}
}
bubble_sort(a, a_s);
bubble_sort(b, b_s);int counter1 = 0,
counter2 = 0,
counter3 = 0;
for (int counter = 0; counter < (a_s + b_s) / 2; counter++)
{
if (a[counter1] <= b[counter2]) {
counter3 = a[counter1];
counter1++;
}
else {
counter3 = b[counter2];
counter2++;
}
}
cout << counter3;
system("pause");
return 0;
}function findMedian($nums1, $nums2) {
$medainValue = 0;
$numsMerge = array_merge($nums1, $nums2);
sort($numsMerge, SORT_NUMERIC);
$numsCount = count($numsMerge);
if ($numsCount % 2 == 0) {
$firstMedianValue = $numsMerge[($numsCount - 1) / 2];
$secondMedianValue = $numsMerge[($numsCount - 1) / 2 + 1];
$medainValue = ($firstMedianValue + $secondMedianValue) / 2;
}
else {
$medainValue = intval($numsMerge[($numsCount - 1) / 2]);
}
return $medainValue;
}