【正文】 } 6/2/2022 Chapter 8 Character Arrays and Strings Write a program which will read a string and rewrite it in the alphabetical order. For example, the string STRING should be written as GINRST. 6/2/2022 Chapter 8 Character Arrays and Strings include main ( ) /* Bubble sort 。 else i++。\039。 } else break。 i++。 word[j]。 str[i]。 gets ( word )。 gets ( str )。 int count = 0, i, j。 i ++ ) printf ( %c, str[i] )。amp。 for ( i = n 1。m)。 printf (How many characters do you want to extract?)。 scanf ( %d, amp。 gets ( str )。 int n, m, i。 } i ++ 。 else { printf ( Try again! )。 break。 gets ( n )。 int i = 1。 ) printf ( %4d, name[i++] )。 while( name [i] != 39。 gets ( name )。 int i = 0。 else printf( Not found!\n )。 } while ( i = j )。 } else if ( n a [k] ) j = k 1。 if ( n == a[k] ) { flag = 1。 j = N 1。n)。 printf ( Please the number you want to find:)。 i N。 a[Ni] = t。 } t = a[k]。 j = N i。 i++ ) /*sorting*/ { k = 0。 for( i = 1。 i++ ) scanf ( %d, amp。 for ( i = 0。 } 6/2/2022 Chapter 7 Arrays Develop a program to implement the binary search algorithm. This technique pares the search key value with the value of the element that is midway in a sorted list. Then: (a) If they match, the search is over. (b) If the search key value is less than the middle value, then the first half of the list contains the key value. (c) If the search key value is greater than the middle value, then the second half contains the key value. Repeat this divideandconquer strategy until we have a match. If the list is reduced to one nonmatching elements, then the list does not contain the key value. Use the sorted list created in exercise or use any other sorted list. 6/2/2022 Chapter 7 Arrays define N 10 main() { int a[N], i, j, t, k, n, flag = 0。 i N。 a[Ni] = t。 t = a[k]。 j = N i。 i++ ) { k = 0。 for( i = 1。 i++ ) scanf ( %d, amp。 for ( i = 0。 } } 6/2/2022 Chapter 7 Arrays Selection sort is based on the following idea: Selecting the largest array element and swapping it with the last array element leaves an unsorted list whose size is 1 less than the size of the original list. If we repeat this step again on the unsorted list we will have an ordered list of size 2 and an unordered list size n2. When we repeat this until the size of the unsorted list bees one, the result will be a sorted list. Write a program to implement this algorithm. 6/2/2022 Chapter 7 Arrays define N 10 main() { int a[N], i, j, t, k。 j++ ) printf ( %3d, a[i][j] )。 i ++ ) { for ( j = 0。 for ( i = 0。 j++ ) if ( i + j N 1 ) a[i][j] = 1。 i ++ ) for ( j = 0。 for ( i = 0。 } printf ( \n )。 k ++ ) c[i][j] += a[i][k] * b[k][j]。 j++ ) { for ( k = 0, c[i][j] = 0。 i ++ ) { for ( j = 0。 for ( i = 0。b[i][j] )。 j N。 i N。 printf(Please input matrix B of %d by %d:\n, N, N)。 j++ ) scanf ( %d, amp。 i ++ ) for ( j = 0。 for ( i = 0。 } 6/2/2022 Chapter 7 Arrays Two matrices that have the same number of rows and columns can be multiplied to produce a third matrix. Consider the following two matrices. The product of A and B is a third matrix C of size nxn where each element of C is given by the following equation. Write a program that will read the values of elements of A and B and produce the product matrix C. ??????????????????????????nnnnnnnnnnnnbbbbbbbbbBaaaaaaaaaA212222111211212222111211??????????????? nkkjikij baC16/2/2022 Chapter 7 Arrays define N 10 main ( ) { int a[N][N], b[N][N], c[N][N], i, j, k。 k M + N。 } } printf(The merged numbers are: )。 i++。 continue。 j N || i = M ) { c[k] = b[j]。 k++ ) { if ( b[j] a[i] amp。 for ( k = i = j = 0。 j++ ) scanf ( %d, amp。 for ( j = 0。a[i] )。 i M。 printf(Input %d numbers of array a in ascending order:\n, M)。 } printf ( The student % obtained the highest total marks.\n, s[k][0] )。 i ++ ) if ( m[i] max ) { max = m[i]。 } for ( i = 0, max = m[0], k = 0。 k = i。 i N。 j = 3。 i ++ ) printf( Total marks of student % is : %.2f\n, s[i][0], m[i] )。} for ( i = 0。s[i][3])。 printf(The mark of Subjcet 3 : )。s[i][2])。 printf(The mark of Subjcet 2 : )。s[i][1])。 printf(The mark of Subjcet 1 : )。 scanf(%f, amp。 i N。 printf(Please input the roll number and marks of %d students.\n, N)。 } } 6/2/2022 Chapter 7 Arrays The annual examination results of 100 students are tabulated as follows: Write a program to read the data and determine the following: (a) Total marks obtained by each student. (b) The highest marks in each subject and the Roll No. of the student who secured it. (c) The student who obtained the highest total marks. Roll No. Subject 1 Subject 2 Subject 3 6/2/2022 Chapter 7 Arrays define N 100 main ( ) { float s[N][4] = {0}, m[N] = {0}, max。 j++ ) printf ( %5d, p[i][j] )。 i ++ ) { for ( j = 0。 for ( i = 0。 j++ ) if ( j == 0 || i == j ) p[i][j] = 1。 i ++ ) for ( j = 0。 for ( i = 0。 } 6/2/2022 Chapter 7 Arrays The following set of numbers is popularly known as Pascal39。 count ++ ) printf(Candidate%3d ballots: %d \n,count,candidate[count])。 for ( count = 1。count )。 else spoilt ++。amp。count )。 to end the voting.\n )。 printf ( Please input the votes (1~5) and press 39。spoilt ballot39。 printf ( The scrap value at the end of useful life of the item is %.2f\n, p )。 i = n。n )。 printf ( The number of years is: )。 scanf ( %f, amp。