顺序表基本操作及冒泡排序

在前面顺序表基础上加上冒泡排序

#include<stdio.h>
#include<assert.h>
#include<iostream>
using namespace std;

#define MAX_SIZE 20

typedef struct {
    int a[MAX_SIZE];
    int size;
}seqlist;

//顺序表初始化
void  init_list(seqlist *l) //?&l
{
    assert(l); l已经有内存空间还要不要判断?
    l->a[10] = 0;
    l->size = 0;
}
//尾插
void  last_insert(seqlist *l, int n)
{
    assert(l);
    if (l->size < MAX_SIZE)
    {
        l->a[l->size] = n;
        l->size++;
    }
    else
    {
        cout << "空间不足" << " ";
    }
}
//尾删
void last_delete(seqlist *l)
{
    assert(l);
    if (l->size == 0)
    {
        cout << "顺序表元素为空" << " ";
    }
    if (l->size != 0)
        l->a[l->size] = 0;
    l->size--;
}
//头插
void front_insert(seqlist *l, int n)
{
    assert(l);
    if (l->size == 0)
        l->a[l->size] = n;
    else
    {
        for (int j = l->size; j > 0; j--)
            l->a[j] = l->a[j - 1];
        l->a[0] = n;
    }
    l->size++;
}
//头删
void front_delete(seqlist *l)
{
    assert(l);
    if (l->size == 0)
    {
        printf("顺序表无元素");
    }
    for (int i = 0; i < l->size; i++)
    {
        l->a[i] = l->a[i + 1];
    }
    l->size--;
}
//读取数为n的数组下标
void read(seqlist *l, int n)
{
    assert(l);
    if (n <= l->size)
        std::cout << n << ":" << l->a[n - 1] << " ";
}
//把第i个数改为m
void change(seqlist *l, int i, int m)
{
    assert(l);
    l->a[i - 1] = m;
}
//打印顺序表
void print(seqlist *l)
{
    assert(l);
    for (int i = 0; i < l->size; i++)
        printf("%d ", l->a[i]);
}
//数组下标为n的数
void find(seqlist *l, int n)
{
    assert(l);
    for (int i = 0; i < l->size; i++)
    {
        if (l->a[i] == n)
            printf("数组下标为%d的等于%d ", i,n);
    }
}
//在第i个位置上插入数字n
int insert(seqlist *l, int i, int n)
{
    if (i<1 || i>l->size + 1)
    {
        cout << "插入位置不对" << " ";
        return -1;
    }
    if (l->size == MAX_SIZE - 1)
    {
        cout << "存储空间不足" << " ";
        return -1;
    }
    for (int j = l->size; j >= i; j--)
    {
        l->a[j] = l->a[j - 1];
    }
    l->a[i - 1] = n;
    l->size++;
    return 0; //return 1和return 0?
}
//冒泡排序
void bubblesort(seqlist *l)
{
    if (l->size == 0)
    {
        cout << "顺序表空" << " ";
        return;
    }
    for (int i = 0; i < l->size-1;i++)
        for (int j = 0; j < l->size - 1;j++)
            if (l->a[j] < l->a[j + 1])
            {
                int tmp;
                {
                    tmp = l->a[j];
                    l->a[j] = l->a[j + 1];
                    l->a[j + 1] = tmp;
                }
            }
}
int main()
{
    int n;
    seqlist l;
    init_list(&l);
    last_insert(&l, 3);
    last_insert(&l, 5);
    last_insert(&l, 4);
    insert(&l, 2, 3);
    insert(&l, 3, 3);
    find(&l, 3);
    bubblesort(&l);
    last_delete(&l);
    front_insert(&l, 11);
    front_delete(&l); 
    read(&l, 3);
    change(&l, 1, 9);
    find(&l, 4);
    print(&l);
    system("pause");
    return 0;
}