int ages[3] = {4, 6, 9};
int nums[10] = {1,2}; // 其余的自動(dòng)初始化為0
int nums[] = {1,2,3,5,6}; // 根據(jù)大括號(hào)中的元素個(gè)數(shù)確定數(shù)組元素的個(gè)數(shù)
int nums[5] = {[4] = 3,[1] = 2}; // 指定元素個(gè)數(shù),同時(shí)給指定元素進(jìn)行初始化
int nums[3]; nums[0] = 1; nums[1] = 2; nums[2] = 3; // 先定義，后初始化

int ages['A'] = {19, 22, 33};

printf("ages[0] = %d\n", ages[0]);

int ages[5 + 5] = {19, 22, 33};

printf("ages[0] = %d\n", ages[0]);

int ages['A' + 5] = {19, 22, 33};

printf("ages[0] = %d\n", ages[0])

int a[]; // 錯(cuò)誤

int number = 10;

int ages[number]; // 不報(bào)錯(cuò), 但是沒(méi)有初始化, 里面是隨機(jī)值
  > int number = 10;
  > 
  > int ages[number] = {19, 22, 33} // 直接報(bào)錯(cuò)

 - > int ages10[5];
  > 
  > ages10 = {19, 22, 33};  // 錯(cuò)誤。只能在定義數(shù)組的時(shí)候進(jìn)行一次性（全部賦值）的初始化

void printMyArray(int myArray[]) {
   int length = sizeof(myArray) / sizeof(myArray[0]);
   for(int i = 0; i < length; i++) {
    printf("%i", myArray[i]);
   }
}

int main() {
  int myArray[5] = {1,2,3,4,5};
  printMyArray(myArray);
  return 0;
}

void printMyArray(int myArray[], int length) {
  for(int i = 0; i < length; i++) {
    printf("%i ", myArray[i]);
  }
}

int main(int argc, const char * argv[]) {
  int myArray[5] = {1,2,3,4,5};
  int length = sizeof(myArray) / sizeof(myArray[0]);
  printMyArray(myArray, length);
  return 0;
}

// 空間換時(shí)間, 適合數(shù)據(jù)比較少
//  1.定義數(shù)組,保存用戶輸入的整數(shù)
//  一定要給數(shù)組初始化, 否則有可能是一些隨機(jī)值
  int numbers[10] = {0};
//  2.接收用戶輸入的整數(shù)
//  2.1定義變量接收用戶輸入的整數(shù)
  int index = -1;
  for (int i = 0; i < 6; i++) {
    printf("請(qǐng)輸入第%d個(gè)整數(shù)\n", i + 1);
    scanf("%d", &index);
//    將用戶輸入的值作為索引取修改數(shù)組中對(duì)應(yīng)的元素的值為1
//    指針的時(shí)候回來(lái)演示剛才的問(wèn)題
    numbers[index] = 1 ;
  }

  int length = sizeof(numbers) / sizeof(numbers[0]);
  for (int i = 0; i < length; i++) {
    if (1 == numbers[i]) {
      // 輸出索引
      printf("%d", i);
    }
  }

//  1.定義數(shù)組,保存用戶輸入的整數(shù)
  int numbers[10] = {0};
//  2.接收用戶輸入的整數(shù)
//  2.1定義變量接收用戶輸入的整數(shù)
  int index = -1;
  for (int i = 0; i < 6; i++) {
    printf("請(qǐng)輸入第%d個(gè)整數(shù)\n", i + 1);
    scanf("%d", &index);
//    將用戶輸入的值作為索引取修改數(shù)組中對(duì)應(yīng)的元素的值為1
//    假設(shè) 用戶輸入的是 1,1,1,2,2,2
    numbers[index] = numbers[index] + 1 ;
  }

  int length = sizeof(numbers) / sizeof(numbers[0]);
  for (int i = 0; i < length; i++) {
//    j = 1 因?yàn)槿绻麛?shù)組元素中存儲(chǔ)的值是0不用輸出
//    將i對(duì)應(yīng)存儲(chǔ)空間中的元素取出,判斷需要輸出幾次
    for (int j = 1; j <= numbers[i]; j++) {
      printf("%d", i);// 1 1 1 2 2 2
    }
  }

void selectSort(int numbers[], int length) {
  for (int i = 0; i < length; i++) {
    for (int j = i + 1; j < length; j++) {
      if (numbers[i] < numbers[j]) {
        int temp = numbers[i];
        numbers[i] = numbers[j];
        numbers[j] = temp;
      }
    }
  }
}

int main(int argc, const char * argv[]) {
  int myArray[] = {42, 7, 1, -3, 88};
  int length = sizeof(myArray) / sizeof(myArray[0]);
  selectSort(myArray, length);
  for (int i = 0; i < length; i++) {
    printf("%i ", myArray[i]);
  }
  return 0;
}

void bubbleSort(int numbers[], int length) {
  for (int i = 0; i < length - 1; i++) {
    for (int j = 0; j < length - i - 1; j++) {
      if (numbers[j] > numbers[j + 1]) {
        int temp = numbers[j];
        numbers[j] = numbers[j + 1];
        numbers[j + 1] = temp;
      }
    }
  }
}

int main(int argc, const char * argv[]) {
  int myArray[] = {42, 7, 1, -3, 88};
  int length = sizeof(myArray) / sizeof(myArray[0]);
  bubbleSort(myArray, length);
  for (int i = 0; i < length; i++) {
    printf("%i ", myArray[i]);
  }
  return 0;
}

int binSearch(int myArray[], int length, int key) {
  int index = -1;

  int max = length - 1;
  int min = 0;
  int mid = (max + min) / 2;

  while (min <= max) {
    if (myArray[mid] > key) {
      max = mid - 1;
    } else if (myArray[mid] < key){
      min = mid + 1;
    } else if (myArray[mid] == key) {
      index = mid;
      break;
    }
    mid = (max + min) / 2;
  }

  return index;
}

int main(int argc, const char * argv[]) {
  int myArray[] = {-3, 1, 7, 42, 88};
  int length = sizeof(myArray) / sizeof(myArray[0]);
  int index = binSearch(myArray, length, 88);
  printf("index: %i ", index);
  return 0;
}