1 - Krijo nje program ne C++ qe gjen numrin me te madh te vektorit.
#include<bits/stdc++.h> using namespace std; int gjej_nr(int nums[], int n) { return *nr_max(nums, nums + n); } int main() { int nums[] = { 5, 4, 9, 12, 8 }; int n = sizeof(nums) / sizeof(nums[0]); cout << "Vektori:"; for (int i=0; i < n; i++) cout << nums[i] <<" "; cout << "\nNumri me i madh: "<< gjej_nr(nums, n);
return 0; }
2 - Krijo nje program ne C++ qe gjen numrin e dyte me te madh te vektorit.
#include<bits/stdc++.h> using namespace std; void gjej_nr(int nums[], int arr_size) { int i, first_element, second_element; if (arr_size < 2) { cout<< " Error "; return; } first_element = second_element = INT_MIN; for (i = 0; i < arr_size ; i ++) { if (nums[i] > first_element) { second_element = first_element; first_element = nums[i]; } else if (nums[i] > second_element && nums[i] != first_element) { second_element = nums[i]; } } if (second_element == INT_MIN) { cout<< "Nuk ka numer te dyte me te madh"; } else { cout<< "\nNumri i dyte me i madh eshte: " <<second_element; } } int main() { int nums[] = {7, 12, 9, 15, 19, 32, 56, 70}; int n = sizeof(nums)/sizeof(nums[0]); cout << "Vektori: "; for (int i=0; i < n; i++) cout << nums[i] <<" "; gjej_nr(nums, n); return 0; }
3 - Krijo nje program ne C++ qe gjen numrat te cilat perseriten nga 2 here ne vektor.
#include <bits/stdc++.h> using namespace std; int main() { int num[] = {1, 2, 3, 5, 5, 7, 8, 8, 9, 9, 2}; int i, j; int size = sizeof(num)/sizeof(num[0]); cout << "Vektori: "; for (i = 0; i < size; i++) cout << nums[i] <<" "; cout << "\nNumrat perserites: "; for(i = 0; i < size; i++) for(j = i+1; j < size; j++) if(nums[i] == nums[j]) cout << nums[i] << " "; return 0; }
4 - Krijo nje program ne C++ qe gjen dhe afishon te gjithe elementet unike.
#include <iostream> using namespace std; int main() { int array1[] = {1, 5, 7, 5, 8, 9, 11, 11, 2, 5, 6}; int s1 = sizeof(array1)/sizeof(array1[0]); cout << "Vektori: "; for (int i=0; i < s1; i++) cout << array1[i] <<" "; cout <<"\nElementet e perbashket: "; for (int i=0; i<s1; i++) { int j; for (j=0; j<i; j++) if (array1[i] == array1[j]) break; if (i == j) cout << array1[i] << " "; } return 0; }
5 - Krijo nje program ne C++ qe zhvendos te gjithe elementet negative te vektorit ne fund te tij.
#include <bits/stdc++.h> using namespace std; void zhvendos(int nums[], int n) { int rezult[n]; int j = 0; for (int i = 0; i < n ; i++) if (nums[i] >= 0 ) rezult[j++] = nums[i]; if (j == n || j == 0) return; for (int i = 0 ; i < n ; i++) if (nums[i] < 0) rezult[j++] = nums[i]; memcpy(nums, result, sizeof(result)); } int main() { int nums[] = {0, 9, -7, 2, -12, 11, -20}; int n = sizeof(nums)/sizeof(nums[0]); cout << "Vektori: "; for (int i=0; i < n; i++) cout << nums[i] <<" "; zhvendos(nums, n); printf("\nVektori pas zhvendosjes "); for (int i=0; i < n; i++) cout << nums[i] <<" "; return 0; }
0 Comments