ordered list

#include <iostream>
#define list_size 5

using namespace std;

struct list {
    int length = 0;
    int items[list_size];
};

void insert(struct list *ls, int value) {
    int i;
    for(i = ls->length-1; i >= 0 && ls->items[i] > value; i--) {
        ls->items[i+1] = ls->items[i];
    }
    ls->items[i+1] = value;
    ls->length++;
}

void print_all(struct list *ls) {
    cout << "Printing all elements: ";
    for(int i = 0; i < ls->length; i++) {
        cout << ls->items[i] << " ";
    }
    cout << "\n";
}

int get(struct list *ls, int index) {
    return ls->items[index];
}

int search(struct list *ls, int value) {
    int left = 0;
    int right = ls->length-1;
    while(left <= right) {
        int mid = (left+right)/2;
        if(ls->items[mid] == value) {
            // Found the item
            return mid;
        }
        else if(ls->items[mid] < value) {
            left = mid+1;
        }
        else {
            right = mid-1;
        }
    }
    return -1;
}

void delete_item(struct list *ls, int index) {
    for(int i = index+1; i < ls->length; i++) {
        ls->items[i-1] = ls->items[i];
    }
    ls->length--;
}



int main()
{
    list myList;

    insert(&myList, 5);
    insert(&myList, 3);
    insert(&myList, 7);

    print_all(&myList);

    int index = search(&myList, 5);
    cout << "Found 5 at index: " << index << "\n";
    delete_item(&myList, index);

    print_all(&myList);
    return 0;
}