6dop

 avatar
gorazd
c_cpp
a year ago
1.2 kB
7
Indexable
#include <iostream>
#include <cctype>
#include <cstring>
using namespace std;

void swap(int *a, int *b)
{
    int temp = *a;
    *a = *b;
    *b = temp;
}
void bubbleSort(int *arr, int len)
{
    bool swapped = true;
    while (swapped)
    {
        swapped = false;
        for (int i = 0; i < len - 1; i++){
            if (arr[i] > arr[i + 1]){
                swap(arr[i], arr[i + 1]);
            swapped = true;
            }
        }
    }
}

void smallestEvenAppearance(int *arr, int len)
{
    for(int i = 0; i < len; i++)
    {
        int number = arr[i];
        int count = 0;
        for(int j = 0; j < len; j++)
        {
            if(arr[j]==number)
                count++;
        }
        if(count%2==0)
        {
            cout<<"Najmaliot element koj se pojavuva paren broj pati e "<<number;
            return;
        }

    }
    cout<<"Nitu eden element ne se pojavuva paren broj pati!";
}

int main() {
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    bubbleSort(arr, n);
    /*for (int i = 0; i < n; i++)
    {
        cout << arr[i] << " ";
    }*/
    smallestEvenAppearance(arr, n);
}
Editor is loading...
Leave a Comment