Code:
(*BAI 6*)
n = Input["Nhan Vao n"];
(*a/ Tao l = l1 + l2 sap xep tang dan*)
L1 = Table[Random[Integer, {50, 1000}], {n}];
L2 = Table[Fibonacci[Random[Integer, {10, 16}]], {n}];
Print["DS Tang: ", L = Sort[Join[L1, L2]]];
(*b/ Tao DS s vua La so nguyen va so thuoc day Fibonacci *)
KtFibonacci[k_] := Module[{i},
i = 1;
While[Fibonacci[i] <= k,
If[Fibonacci[i] == k,
Return[1]
];
i++
];
Return[0]
];
DSNguyenToVaFibonacci[L1_, L2_] := Module[{j, L, S},
L = Sort[Join[L1, L2]];
j = 1;
S = {};
While[j ≤ Length[L],
If[PrimeQ[L[[j]]] && KtFibonacci[L[[j]]] == 1,
S = Append[S, L[[j]]]
];
j++
];
Return[S]
];
(*c/ Tao danh sach giam dan tu 2 danh sach L1 L2 *)
L3 = Sort[Join[L1, L2], Greater];
Print["DS Giam :", L3];
(*d/sap xep L tang dan dung SelectionSort *)
SelectionSort[A_] := Module[{k, temp, n, i, j, B},
B = A;
n = Length[B];
k = 0;
For[i = 1, i < n, i++,
k = i;
For[j = i + 1, j <= n, j++,
If[B[[j]] < B[[k]],
k = j
]
];
temp = B[[i]];
B[[i]] = B[[k]];
B[[k]] = temp;
];
Return [B]
];
Code này chưa hoàn chỉnh các bạn bổ sung thêm nha.