Question

Finish the code below (using bubble sort) to sort the datafile in ascending order. each number should stop after "t"

#include

#include

#include

int main()

{

char letter[1400];

int length;

FILE *fptr;

if ((fptr = fopen("datafile1.txt","r")) == NULL)

{

printf("Error! opening file");

return (1);

}

if (fgets(letter,5000,fptr) != NULL)

{

printf("The string is in the file is\n\n");

puts(letter);

}

fclose(fptr);

printf("\n\n");

length = strlen(letter);

sortascending(length,letter);

puts(letter);

return 0;

}

***datafile1.txt***
1804289383t846930886t681692777t1714636915t1957747793tn424238335t719885386t1649760492t596516649t1189641421tn1025202362t1350490027t783368690t1102520059t2044897763tn1967513926t1365180540t1540383426t304089172t1303455736tn35005211t521595368t294702567t1726956429t336465782tn861021530t278722862t233665123t2145174067t468703135tn1101513929t1801979802t1315634022t635723058t1369133069tn1125898167t1059961393t2089018456t628175011t1656478042tn1131176229t1653377373t859484421t1914544919t608413784tn756898537t1734575198t1973594324t149798315t2038664370tn1129566413t184803526t412776091t1424268980t1911759956tn749241873t137806862t42999170t982906996t135497281tn511702305t2084420925t1937477084t1827336327t572660336tn1159126505t805750846t1632621729t1100661313t1433925857tn1141616124t84353895t939819582t2001100545t1998898814tn1548233367t610515434t1585990364t1374344043t760313750tn1477171087t356426808t945117276t1889947178t1780695788tn709393584t491705403t1918502651t752392754t1474612399tn2053999932t1264095060t1411549676t1843993368t943947739tn1984210012t855636226t1749698586t1469348094t1956297539tn

update** I'm supposed to write a code that scans a file (datafile1.txt) and sorts it in ascending order and the numbers have to be cut after every t. so far what I have is

#include <stdio.h>

#include <stdlib.h>

#include <stdio.h>

int main()

{

int array[100], n, c, d, swap, length;

char letter[1400];

FILE *fptr;

if ((fptr = fopen("datafile1.txt","r")) == NULL)

{

printf("Error! opening file");

return (1);

}

if (fgets(letter,5000,fptr) != NULL)

{

printf("The string is in the file is\n\n");

puts(letter);

}

fclose(fptr);

printf("\n\n");

length = strlen(letter);

sortascending(length,letter);

puts(letter);

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

scanf("%d", &array[c]);

for (c = 0 ; c < n - 1; c++)

{

for (d = 0 ; d < n - c - 1; d++)

{

if (array[d] > array[d+1]) /* For decreasing order use < */

{

swap = array[d];

array[d] = array[d+1];

array[d+1] = swap;

}

}

}

printf("Sorted list in ascending order:\n");

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

printf("%d\n", array[c]);

return 0;

}

Answer 1

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

int main()

{

int array[100], n, c, d,k, swap, length;

char letter[1400],temp[100];

FILE *fptr;
//unable to open the file
if ((fptr = fopen("d://datafile1.txt","r")) == NULL)

{

printf("Error! opening file");

return (1);

}

//read the data from file
while(fgets(letter,5000,fptr) != NULL)

{

printf("The string is in the file is\n\n");

puts(letter);

}
//close the file
fclose(fptr);

printf("\n\n");

d=0;//d will count the number of number stored in array
k=0;
//loop will execute till the end of letter
for(c=0;letter[c]!='\0';c++)
{
   if(letter[c]=='t') //condition for t
   {
       temp[k]='\0'; //assign null to the end of temp
       array[d]=atoi(temp);//store the temp by converting to integer
       d++; //increment the value of d
       //c++;
       strcpy(temp,"\0");//erase the value of temp
       k=0;//assign 0 to k for temp to store another word
       }
   else
   {
      temp[k]=letter[c]; //copy the characters to temp
      k++;//increase the index
   }  
  
}
//logic to store the last number
temp[k]='\0';
array[d]=atoi(temp);
d++;
//print the numbers stored in array
for (c = 0; c < d; c++)

printf("\n %d ", array[c]);
n=d;//assign the value of d to n as the sizeof array
//logic for bubble sort
for (c = 0 ; c < n-1; c++)

{

for (d = 0 ; d < n-c-1; d++)

{

if (array[d] > array[d+1]) /* For decreasing order use < */

{

swap = array[d];

array[d] = array[d+1];

array[d+1] = swap;

}

}

}
//print the sorted array
printf("\n\nSorted list in ascending order:\n");

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

printf("%d\n", array[c]);

return 0;

}

OUTPUT