printf("排序后的数据\n"); for( i=1;i< = list-> length ;i++) printf("list. elem[%d]. key=%d\n",i, list->elem [i]); printf("\n请输入查找的值:");有何错误

这段代码没有明显的语法错误，但是在输出时存在一个小错误：`list. elem`应该是`list->elem`。应该修改为：

printf("排序后的数据\n");     
for (i = 1; i <= list->length; i++)     
    printf("list->elem[%d].key=%d\n", i, list->elem[i]);     
printf("\n请输入查找的值:");

这样才能正确输出排序后的数据。

相关问题

#include<stdio. h> #define MAX 100 typedef struct int elem[MAX+1]; int length; }Stable; void creat_seq( Stable* list); int sort seq( Stable* list); int bin search( Stable* list, int k, int low, int high); void main() Stable *list, table; int i, key; list=&table; printf("请输入线性表的长度:"); scanf("%d",&list->length); creat_seq( list)； sort_seq( list); printf("排序后的数据 "); for( i=1;i< = list-> length ;i++) printf("list. elem[%d]. key=%d ",i, list->elem [i]); printf(" 请输入查找的值:"); scanf("%d",&key); bin_search( list, key,1, list-> length); void creat_seq( Stable* list) int i; printf("请输入顺序表的内容: "); for( i=1;i< = list-> length;i++) printf("list. elem[%d]. key=",i); scanf("%d",&list-> elem[i]); int sort_seq( Stable* list) /*冒泡法排序*/ int i,j, flag; for( i=1;i< list-> length;i++) flag =0; for(j=1;j< list->length-i+1;j++) if(list->elem [j]>list->elem [j+1]) list->elem [0]=list->elem [j+1]; list->elem [j+1] =list->elem [j]; list->elem [j] =list->elem [0]; flag =1; if(flag ==0) return 1; int bin search( Stable* list, int k, int low, int high)/*折半查找法的递归函数*/ int mid; if(low>high) printf("没有找到要查找的值 "); return(0); mid=(low+high)/2; if( list->elem [mid] ==k) --- printf("查找成功 "); printf("list[%d] =%d ", mid,k); return(mid); else if(list->elem [mid]<k) return( bin_search( list,k, mid+1, high)); else return( bin_search( list,k, low, mid-1));修改这段代码

以下是修改后的代码：

#include <stdio.h>
#define MAX 100

typedef struct {
  int elem[MAX + 1];
  int length;
} Stable;

void creat_seq(Stable *list);
void sort_seq(Stable *list);
int bin_search(Stable *list, int k, int low, int high);

int main() {
  Stable table;
  Stable *list = &table;
  int key;

  printf("请输入线性表的长度: ");
  scanf("%d", &list->length);
  creat_seq(list);
  sort_seq(list);
  printf("排序后的数据: ");
  for (int i = 1; i <= list->length; i++) {
    printf("%d ", list->elem[i]);
  }
  printf("\n请输入查找的值: ");
  scanf("%d", &key);
  bin_search(list, key, 1, list->length);

  return 0;
}

void creat_seq(Stable *list) {
  printf("请输入顺序表的内容: ");
  for (int i = 1; i <= list->length; i++) {
    printf("list.elem[%d].key = ", i);
    scanf("%d", &list->elem[i]);
  }
}

void sort_seq(Stable *list) {
  /*冒泡排序*/
  int i, j, flag;
  for (i = 1; i < list->length; i++) {
    flag = 0;
    for (j = 1; j <= list->length - i; j++) {
      if (list->elem[j] > list->elem[j + 1]) {
        list->elem[0] = list->elem[j + 1];
        list->elem[j + 1] = list->elem[j];
        list->elem[j] = list->elem[0];
        flag = 1;
      }
    }
    if (flag == 0) {
      return;
    }
  }
}

int bin_search(Stable *list, int k, int low, int high) {
  /*折半查找法的递归函数*/
  int mid;
  if (low > high) {
    printf("没有找到要查找的值\n");
    return 0;
  }
  mid = (low + high) / 2;
  if (list->elem[mid] == k) {
    printf("查找成功，list[%d] = %d\n", mid, k);
    return mid;
  } else if (list->elem[mid] < k) {
    return bin_search(list, k, mid + 1, high);
  } else {
    return bin_search(list, k, low, mid - 1);
  }
}

修改后的主要变化是：

1. 在结构体中添加了 `int length`，用于记录线性表的长度。
2. 在 `sort_seq()` 函数中修正了冒泡排序算法的实现错误。
3. 在 `bin_search()` 函数中添加了查找成功的输出语句，并在没有找到要查找的值时输出提示信息。

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_SIZE 100 typedef struct { int book_id; char book_name[50]; float price; } Book; typedef struct { Book books[MAX_SIZE]; int length; } BookList; void input_books(BookList* list, int n) { for (int i = 0; i < n; i++) { printf("请输入第%d本书的信息：\n", i + 1); printf("图书编号："); scanf("%d", &list->books[i].book_id); printf("书名："); scanf("%s", list->books[i].book_name); printf("价格："); scanf("%f", &list->books[i].price); } list->length = n; } void display_books(BookList* list) { printf("图书表中所有图书的相关信息：\n"); for (int i = 0; i < list->length; i++) { printf("图书编号：%d\n", list->books[i].book_id); printf("书名：%s\n", list->books[i].book_name); printf("价格：%f\n", list->books[i].price); } } void insert_book(BookList* list, int pos, Book book) { if (pos < 1 || pos > list->length + 1) { printf("插入位置不合法！\n"); return; } for (int i = list->length - 1; i >= pos - 1; i--) { list->books[i + 1] = list->books[i]; } list->books[pos - 1] = book; list->length++; } void delete_book(BookList* list, int pos) { if (pos < 1 || pos > list->length) { printf("删除位置不合法！\n"); return; } for (int i = pos - 1; i < list->length - 1; i++) { list->books[i] = list->books[i + 1]; } list->length--; } int count_books(BookList* list) { return list->length; } int partition(BookList* list, int low, int high) { Book pivot = list->books[low]; while (low < high) { while (low < high && list->books[high].book_id >= pivot.book_id) high--; list->books[low] = list->books[high]; while (low < high && list->books[low].book_id <= pivot.book_id) low++; list->books[high] = list->books[low]; } list->books[low] = pivot; return low; } void quick_sort(BookList* list, int

) {
if (list->length <= 1) return;
int stack[MAX_SIZE], top = -1;
stack[++top] = 0;
stack[++top] = list->length - 1;
while (top > 0) {
int high = stack[top--];
int low = stack[top--];
int mid = partition(list, low, high);
if (low < mid - 1) {
stack[++top] = low;
stack[++top] = mid - 1;
}
if (mid + 1 < high) {
stack[++top] = mid + 1;
stack[++top] = high;
}
}
}

int main() {
BookList list;
input_books(&list, 3);
display_books(&list);
Book book = { 4, "Data Structures and Algorithms", 45.8 };
insert_book(&list, 2, book);
display_books(&list);
delete_book(&list, 3);
display_books(&list);
int count = count_books(&list);
printf("图书表中共有%d本图书。\n", count);
quick_sort(&list, count);
display_books(&list);
return 0;
}

这是一个图书管理系统的代码，实现了图书的增删查改和快速排序功能。其中Book和BookList为自定义的结构体，分别表示图书和图书表。在主函数中，先输入3本图书的信息，然后显示所有图书的信息，接着在第二个位置插入一本新书并显示所有图书的信息，再删除第三本书并显示所有图书的信息。然后统计图书数量并输出，最后对图书表进行快速排序并输出排序结果。