一级毛片免费不卡在线视频,国产日批视频免费在线观看,菠萝菠萝蜜在线视频免费视频,欧美日韩亚洲无线码在线观看,久久精品这里精品,国产成人综合手机在线播放,色噜噜狠狠狠综合曰曰曰,琪琪视频

c語言面試編程題

時(shí)間:2024-09-11 11:14:50 資料大全 我要投稿
  • 相關(guān)推薦

c語言面試編程題

  1、讀文件 file1.txt 的內(nèi)容(例如):

c語言面試編程題

  12

  34

  56

  輸出到 file2.txt:

  56

  34

  12

  #include

  #include

  int main(void)

  {

  int MAX = 10;

  int *a = (int *)malloc(MAX * sizeof(int));

  int *b;

  FILE *fp1;

  FILE *fp2;

  fp1 = fopen("a.txt","r");

  if(fp1 == NULL)

  {printf("error1");

  exit(-1);

  }

  fp2 = fopen("b.txt","w");

  if(fp2 == NULL)

  {printf("error2");

  exit(-1);

  }

  int i = 0;

  int j = 0;

  while(fscanf(fp1,"%d",&a[i]) != EOF)

  {

  i++;

  j++;

  if(i >= MAX)

  {

  MAX = 2 * MAX;

  b = (int*)realloc(a,MAX * sizeof(int));

  if(b == NULL)

  {

  printf("error3");

  exit(-1);

  }

  a = b;

  }

  }

  for(;--j >= 0;)

  fprintf(fp2,"%d\n",a[j]);

  fclose(fp1);

  fclose(fp2);

  return 0;

  }

  2、寫一段程序,找出數(shù)組中第 k 大小的數(shù),輸出數(shù)所在的位置,

c語言面試編程題

。例如{2,4,3,4,7}中,第一大的數(shù)是 7,位置在 4。第二大、第三大的數(shù)都是 4,位置在 1、3 隨便輸出哪一個(gè)均可。

  函數(shù)接口為:int find_orderk(const int* narry,const int n,const int k)

  要求算法復(fù)雜度不能是 O(n^2)

  可以先用快速排序進(jìn)行排序,其中用另外一個(gè)進(jìn)行地址查找代碼如下,在 VC++6.0 運(yùn)行通過。

  //快速排序

  #include

  usingnamespacestd;

  intPartition (int*L,intlow,int high)

  {

  inttemp = L[low];

  intpt = L[low];

  while (low < high)

  {

  while (low < high && L[high] >= pt)

  --high;

  L[low] = L[high];

  while (low < high && L[low] <= pt)

  ++low;

  L[low] = temp;

  }

  L[low] = temp;

  returnlow;

  }

  voidQSort (int*L,intlow,int high)

  {

  if (low < high)

  {

  intpl = Partition (L,low,high);

  QSort (L,low,pl - 1);

  QSort (L,pl + 1,high);

  }

  }

  intmain ()

  {

  intnarry[100],addr[100];

  intsum = 1,t;

  cout << "Input number:" << endl;

  cin >> t;

  while (t != -1)

  {

  narry[sum] = t;

  addr[sum - 1] = t;

  sum++;

  cin >> t;

  }

  sum -= 1;

  QSort (narry,1,sum);

  for (int i = 1; i <= sum;i++)

  cout << narry[i] << '\t';

  cout << endl;

  intk;

  cout << "Please input place you want:" << endl;

  cin >> k;

  intaa = 1;

  intkk = 0;

  for (;;)

  {

  if (aa == k)

  break;

  if (narry[kk] != narry[kk + 1])

  {

  aa += 1;

  kk++;

  }

  }

  cout << "The NO." << k << "number is:" << narry[sum - kk] << endl;

  cout << "And it's place is:" ;

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

  {

  if (addr[i] == narry[sum - kk])

  cout << i << '\t';

  }

  return0;

  }

【c語言面試編程題】相關(guān)文章:

c 面試編程問題08-11

C++面試筆試題目07-16

面試語言技巧07-24

影響面試的肢體語言07-23

面試的幾種肢體語言09-11

外企面試筆試智力題10-25

一定做好面試附加題06-13

C/C++筆試題目大全08-22

c語言課程設(shè)計(jì)的心得體會(huì)(精選19篇)07-14

應(yīng)聘者面試遭遇“愛情題” 面試官在考什么?07-04