Algoritmlarni loyihalash” fanidan laboratoriya ishlari

Topshiriqlar:
1.To’plam ostilari yig’indisini hisoblash algoritmini tuzing.
Javob
#include
using namespace std;
// Function to find the sum of all
// sub-sets of size K
void findSumOfAllSubsets(int arr[], int n, int k)
{
// Frequency of each array element
// in summation equation.
int factorial_N=1, factorial_d=1, factorial_D=1;
 
//calculate factorial of n-1
for(int i=1; i<=n-1; i++)
factorial_N*=i;
//calculate factorial of k-1
for(int i=1; i<=k-1; i++)
factorial_d*=i;
//calculate factorial of n-k
for(int i=1; i<=n-k; i++)
factorial_D*=i;
 
int freq = factorial_N/(factorial_d * factorial_D);
// Calculate sum of array.
int sum = 0;
for (int i = 0; i < n; i++)
sum += arr[i];
 
// Sum of all subsets of size k.
sum = sum * freq;
cout <<"Sum of all subsets of size = "< "<< sum << endl;
}
// Driver Code
int main()
{
int arr[] = { 1, 2, 4, 5 };
int n = 4, k = 2;
findSumOfAllSubsets(arr, n, k);
return 0;
}

Nazorat savollari.
1. To’plam ostilari yig’indisini hisoblash algoritmini qanday amalga oshiriladi.
2. To’plam ostilari yig’indisini hisoblash uchun qanday algoritmlardan foydalaniladi.