data structure question - please help

[farchielad]

I have the following lema I need to proove in order to solve a certain algorithem:

Given two pairs of one dimensional arrays A and AA, B and BB . Each array is sorted and every member of A is smaller than its parallel in AA ( for example the parallel of a member in A is a member of AA located in the same position as that member in A), and every member of B is smaller than its parallel in BB.

AB is a sorted array containing all members of A and B.
AABB is a sorted array containing all members of AA and BB.

Prove that every member in AB is smaller than its parallel in AABB.

For example:
A=[1,6,10], B=[2,3,4], AA=[8,9,17], BB=[5,12,13].
AB=[1,2,3,4,6,10]
AABB=[5,8,9,12,13,17]

Thanks in advance
Elad
farchielad@gmail.com

[farchielad]

Ok nevermind you stupid ****s. I already solved it.
But here is another question for ya.
Maybe you can help with this one, you louzy dumb asses.

also if you cant give a solution do me a favor and kill yourself.

[Khiem]

Why don't you post the result to say you have solved it ?
I have read many similar posts that sounds "seemingly" hard work of OP to offering a solution but unfortunately it is not working or fails to work properly, and of course the final resources lost without a single excuse.