Question: //Include the header files #include #include #include using namespace std; //A function Definition int count(int *a,int N) { //Clock varibales clock_t start_t, end_t, total_t; int
//Include the header files
#include
#include
#include
using namespace std;
//A function Definition
int count(int *a,int N)
{
//Clock varibales
clock_t start_t, end_t, total_t;
int i,j, k;
//Starting the clock
start_t = clock();
cout
int counting = 0;
//Use three loops to find the sum of three
for (i = 0; i
for (j = i+1; j
for (k = j+1; k
{
//Display the sum
cout
//Count the pair
counting++;
}
//end of clock
end_t = clock();
//Display total running time..
total_t = (double)(end_t - start_t);
cout
//Return the pair
return counting;
}
//Starting of main function
int main()
{
//Declare file pointer
ifstream fid;
//Declare array a of type int
int a[10000];
//Declare N
int N=0;
//Open the file
fid.open("numbers1.dat");
//Check if file is open
if(fid.is_open())
{
//Read integer
while(fid>>a[N])
{
//Increment the N by 1
N++;
}
//Close the file
fid.close();
//Display the number count
cout
//Total pairs
cout
}
//otherwise
else
//Display message
cout
//stop
return 0;
}

OUTPUT:

Convert the program to standard C and explain the program.
Plz make sure just convert the program don't change anything else.
Sample input file: numbers!.dat-Notepad File Edit Format View Help 12345678910 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 6162 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 rm Ln 1, Col 1 000000000 234567891 999999999 123456789 888888888 123456789 0777777777 P11234567895 H-96666666661 123456789 Pe 5555555554 |y-71234567891 : N at 6 4 4 4 4 4 4 4 4 4 3 1234567890 For-5333333333 u-1. 41234567892 it-32222222221 e-m|E| 123456789 p-n-le- 1 | le 2 1 1 1 1 1 1 1 1 1 0 E 11234567891
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
