C++ code for k largest elements in an array

// C++ code for k largest elements in an array

#include

using namespace std;

void kLargest(int arr[], int n, int k)

{

// Sort the given array arr in reverse

// order.

sort(arr, arr + n, greater());

// Print the first kth largest elements

for (int i = 0; i < k; i++)

cout << arr[i] << " ";

}

// driver program

int main()

{

int arr[] = { 1, 23, 12, 9, 30, 2, 50 };

int n = sizeof(arr) / sizeof(arr[0]);

int k = 3;

kLargest(arr, n, k);

}

// This article is contributed by Chhavi

#include

using namespace std;

int main ()

{

int arr[10], n, i, max, min;

cout << "Enter the size of the array : ";

cin >> n;

cout << "Enter the elements of the array : ";

for (i = 0; i < n; i++)

cin >> arr[i];

max = arr[0];

for (i = 0; i < n; i++)

{

if (max < arr[i])

max = arr[i];

}

min = arr[0];

for (i = 0; i < n; i++)

{

if (min > arr[i])

min = arr[i];

}

cout << "Largest element : " << max;

cout << "Smallest element : " << min;

return 0;

}