第十一天:数组与字符串

练习:

冒泡,插排,选排

实现字符串拼接,复制,求长

#include <stdio.h>
#include <malloc.h>

#define MAX 100

void insertion_sort() {
  int a[] = {6, 4, 5, 3, 2, 1};
  int length = sizeof(a) / sizeof(int);
  for (int i = 1; i < length; ++i) {
    for (int j = 0; j < i; ++j) {
      if (a[i] < a[j]) {
        int temp = a[i];
        for (int k = j; k <= i; ++k) {
          a[i] = a[k];
          a[k] = temp;
          temp = a[i];
        }
      }
    }
  }
  for (int i = 0; i < length; ++i) {
    printf("%d", a[i]);
  }
}

void bubble_sort() {
  int a[] = {6, 4, 5, 3, 2, 1};
  int length = sizeof(a) / sizeof(int);
  for (int i = 0; i < length; ++i) {
    for (int j = 0; j < length; ++j) {
      int temp;
      if (a[j] > a[j + 1]) {
        temp = a[j];
        a[j] = a[j + 1];
        a[j + 1] = temp;
      }
    }
  }
  for (int i = 0; i < length; ++i) {
    printf("%d", a[i]);
  }
}

void select_sort() {
  int a[] = {6, 4, 5, 3, 2, 1};
  int length = sizeof(a) / sizeof(int);
  for (int i = 0; i < length; ++i) {
    for (int j = i + 1; j < length; ++j) {
      int temp;
      if (a[i] > a[j]) {
        temp = a[i];
        a[i] = a[j];
        a[j] = temp;
      }
    }
  }
  for (int i = 0; i < length; ++i) {
    printf("%d", a[i]);
  }
}

int str_len(char *p) {
  int len = 0;
  for (char *i = p; *i != '\0'; ++i) {
    len++;
  }
  return len;
}

char *str_cpy(char *source) {
  char str[MAX] = {'\0'}, *s = str;
  for (char *i = source; *i != '\0'; ++i, ++s) {
    *s = *i;
  }
  s = str;
  return s;
}

char *str_cat(char *source, char *target) {
  char str[MAX] = {'\0'}, *s = str;
  for (char *i = source; *i != '\0'; ++i, ++s) {
    *s = *i;
  }
  for (char *j = target; *j != '\0'; ++j, ++s) {
    *s = *j;
  }
  s = str;
  return s;
}

int main(int argc, char *argv[]) {
  bubble_sort();
  insertion_sort();
  select_sort();
  char a[] = "hhhhhh";
  char b[] = "wwwwww";
  char *c = str_cat(a, b);
  printf("%s,", c);
  char *d = str_cpy(a);
  printf("%s", d);
  int len = str_len(a);
  printf("%d", len);
  return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值