c语言分别用递归和非递归的方法解决字符串逆序

void reverse(char* str) {
	char tmp = *str;
	int len = strlen(str);
	*str = *(str + len - 1);
	*(str + len - 1) = '\0';
	if (strlen(str + 1) >= 2) {
		reverse(str + 1);
	}
	*(str + len - 1) = tmp;
}
int main() {
	char arr[] = "abcdefg";
	reverse(arr);
	printf("%s", arr);
	return 0;
}

int main() {
	char arr[] = "abcdefg";
	int i = 0;
	int len = strlen(arr);
	int left = 0;
	int right = len - 1;
	for (i = 0; i < len; i++) {
		while (right > left) {
			int tmp = arr[left];
			arr[left] = arr[right];
			arr[right] = tmp;
			left++;
			right--;
		}
	}
	printf("%s", arr);
}