Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #include <stdio.h>
- void ispisNiza(int niz[], int brEl);
- int frekvencija(int niz[], int brEl, int broj);
- void unijaNizova();
- int main() {
- unijaNizova();
- system("pause");
- return 0;
- }
- void unijaNizova() {
- int niz1[100];
- int niz2[100];
- int brEl1, brEl2;
- printf("Koliko elemenata ima prvi niz: ");
- scanf("%d", &brEl1);
- printf("Koliko elemenata ima drugi niz: ");
- scanf("%d", &brEl2);
- int niz3[100];
- int brEl3 = 0;
- int i;
- for (i = 0; i < brEl1; i++) {
- if (frekvencija(niz3, brEl3, niz1[i]) == 0) {
- niz3[brEl3] = niz1[i];
- brEl3++;
- }
- }
- for (i = 0; i < brEl2; i++) {
- if (frekvencija(niz3, brEl2, niz2[i]) == 0) {
- niz3[brEl3] = niz2[i];
- brEl3++;
- }
- }
- ispisNiza(niz3, brEl3);
- }
- void ispisNiza(int niz[], int brEl) {
- int i;
- for (i = 0; i < brEl; i++) {
- printf("%d\t", niz[i]);
- }
- printf("\n");
- }
- int frekvencija(int niz[], int brEl, int broj) {
- int brojac = 0;
- int i;
- for (i = 0; i < brEl; i++) {
- if (niz[i] == broj) {
- brojac++;
- }
- }
- return brojac;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement