1.将顺序表(a1,a2,..an)重新排列以a1为界的两部分,a1前面的值均比a1小,a1后面的值均比a1大。
#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 100
typedef struct//定义结构体
{
int a[MAXSIZE];
int size;
}sequence;
void init_list(sequence *L)//初始化
{
L->size = 0;
}
void input_list(sequence *L)//输入‘-1’结束
{
int data;
printf("请输入:");
while (L)
{
scanf_s("%d", &data);
if (data == -1)
break;
else
{
L->a[L->size] = data;
L->size++;
}
}
printf("\n");
}
void compare_list(sequence *L, int x)//比x小放x前面,比x大放x后面
{
int i, j, y;
for (i = 1; i<L->size; i++)
{
if (x>L->a[i])
{
y = L->a[i];
for (j = i; j>0; j--)
L->a[j] = L->a[j - 1];
L->a[0] = y;
}
}
}
void printf_list(sequence *L)
{
int i;
for (i = 0; i < L->size; i++)
printf("%d ", L->a[i]);
printf("\n");
}
int main()//主函数
{
sequence L;
int x;
init_list(&L);
input_list(&L);
printf("请输入界限数:");
scanf_s("%d", &x);
compare_list(&L, x);
printf_list(&L);
return 0;
}
运行结果
2.有顺序表A和B,其元素均按从小到大的升序排列,编写一个算法将他们合并成一个顺序表C,要求C的元素也按从小到大的顺序排列。
#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 100
typedef struct//定义结构体
{
int a[MAXSIZE];
int size;
}sequence;
void init_list(sequence *L1, sequence *L2)//初始化
{
L1->size = 0;
L2->size = 0;
}
void input_list(sequence *L1, sequence *L2)//输入‘-1’结束
{
int i, j, data1, data2;
printf("请输入A:");
for (i = 0; i < MAXSIZE; i++)
{
scanf_s("%d", &data1);
if (data1 == -1)
break;
L1->a[L1->size++] = data1;
}
printf("\n");
printf("请输入B:");
for (i = 0; i < MAXSIZE; i++)
{
scanf_s("%d", &data2);
if (data2 == -1)
break;
L2->a[L2->size++] = data2;
}
printf("\n");
}
void printf_list(sequence *L1, sequence *L2)
{
int i, j, t;
for (i = 0; i < L1->size-1; i++)//打擂台 将顺序表按从小到大顺序输出
for (j = 0; j <L1->size-i-1; j++)
{
if (L1->a[j] > L1->a[j + 1])
{
t = L1->a[j];
L1->a[j] = L1->a[j + 1];
L1->a[j + 1] = t;
}
}
printf("A:");
for (i = 0; i < L1->size; i++)
printf("%d ", L1->a[i]);
printf("\n");
for (i = 0; i < L2->size -1; i++)
for (j = 0; j <L2->size-i-1; j++)
{
if (L2->a[j] > L2->a[j + 1])
{
t = L2->a[j];
L2->a[j] = L2->a[j + 1];
L2->a[j + 1] = t;
}
}
printf("B:");
for (i = 0; i < L2->size; i++)
printf("%d ", L2->a[i]);
printf("\n");
}
void connect_list(sequence *L1, sequence *L2)
{
int i, j, t;
for (i = 0; i < L2->size; i++)
L1->a[i + L1->size] = L2->a[i];
for (i = 0; i < L1->size + L2->size-1; i++)
for (j = 0; j < L1->size + L2->size - i-1; j++)
{
if (L1->a[j] > L1->a[j + 1])
{
t = L1->a[j];
L1->a[j] = L1->a[j + 1];
L1->a[j + 1] = t;
}
}
printf("连接之后:");
for (i = 0; i < L1->size + L2->size; i++)
printf("%d ", L1->a[i]);
printf("\n");
}
int main()
{
sequence L1, L2;
init_list(&L1, &L2);
input_list(&L1, &L2);
printf_list(&L1, &L2);
connect_list(&L1, &L2);
}
其中的连接 并按从小到大排列的算法:
(打擂台排序)
void connect_list(sequence *L1, sequence *L2)
{
int i, j, t;
for (i = 0; i < L2->size; i++)
L1->a[i + L1->size] = L2->a[i];
for (i = 0; i < L1->size + L2->size-1; i++)
for (j = 0; j < L1->size + L2->size - i-1; j++)
{
if (L1->a[j] > L1->a[j + 1])
{
t = L1->a[j];
L1->a[j] = L1->a[j + 1];
L1->a[j + 1] = t;
}
}
printf("连接之后:");
for (i = 0; i < L1->size + L2->size; i++)
printf("%d ", L1->a[i]);
printf("\n");
}