배열 ADT

c언어

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;
 
struct a {
 
    int* a;
    int size;
    int length;
};
 
void add(a* a,int x) // 맨뒤에 삽입
{
    a->a[a->length++] = x; //값을 넣은 후 ++됨
}
void insert(a& a, int idx, int data) // 원하는곳에 삽입
{
    for (int i = a.length; i > idx; i--)
    {
        a.a[i] = a.a[i - 1];
    }
    a.a[idx] = data;
    ++a.length;
}
void swap123(int* x, int* y) // 위치 변경
{
    int temp = *x;
    *x = *y;
    *y = temp;
}
void Display(a& a) // 출력
{
    for (int i = 0; i < a.length; i++)
    {
        cout << a.a[i] << " ";
    }
    cout << endl;
}
void delete1(a& a, int index) // 삭제
{
    for (int i = index; i < a.length-1; i++)
    {
        a.a[i] = a.a[i + 1];
    }
    a.length--;    
}
int Lineserach(a a, int data) // 라인서치 O(N)
{
    for (int i = 0; i < a.length; i++)
    {
        if (a.a[i] == data)
        {
            swap123(&a.a[i], &a.a[i - 1]);
            return i; //인덱스 i에 있다.
        }
    }
    return -1; //찾지 못하겠다.
}
 
int BinarySearch(a a, int key) // 이진탐색
{
    int low, mid, h;
    low = 0;
    h = a.length - 1;
 
    while (low <= h)
    {
        mid = (low + h) / 2;
        if (key == a.a[mid])
        {
            return mid;
        }
        else if (key > a.a[mid])
        {
            low = mid + 1;
        }
        else
        {
            h= mid - 1;
        }
    }
    return -1;
}
int RBS(a a, int low, int h, int key) //재귀버전 이진탐색
{
    int mid;
    while (low <= h)
    {
         mid = (low + h) / 2;
        if (key == a.a[mid])
        {
            return mid;
        }
        else if (key > a.a[mid])
        {
            return RBS(a, mid + 1, h, key);
        }
        else
            return RBS(a, low, mid - 1, key);
    }
    return -1;
}
 
int Get(a a, int index) //값을 얻다
{
    if (index >= 0 && index < a.length)
        return a.a[index];
    return -1;
}
 
void Set(a* a, int index,int x) // 값을 설정
{
    if (index >= 0 && index < a->length)
        a->a[index] = x;
}
 
int Max(a a) // 최댓값
{
    int max = a.a[0];
    for (int i = 0; i < a.length; i++)
    {
        if (a.a[i] > max)
            max = a.a[i];
    }
    return max;
}
 
int Min(a a) //최소값
{
    int min = a.a[0];
    for (int i = 0; i < a.length; i++)
    {
        if (a.a[i] < min)
            min = a.a[i];
    }
    return min;
}
int& Sum(a a) //합
{
    int total = 0;
    for (int i = 0; i < a.length; i++)
        total += a.a[i];
 
    return total;
}
 
float Avg(a a) //평균
{
    /*int avg = 0;
    avg = Sum(a) / a.length;
    return (float)avg;*/
 
    return (float)Sum(a) / a.length;
}
 
void Reverse(a* a) //거꾸로 뒤집다
{
    int* b;
    int i, j;
    b = new int[a->length];
    for ( i = 0,  j = a->length - 1; j >= 0; i++, j--)
    {
        b[j] = a->a[i];
    }
    for (int i = 0; i < a->length; i++)
    {
        a->a[i] = b[i];
    }
    delete[] b;
}
void Reverse2(a* a) // 두번째 방법
{
    int i, j;
    for (i = 0, j = a->length - 1; i <= j; i++, j--)
    {
        swap123(&a->a[i], &a->a[j]);
    }
}
void InsertSort(a* a, int x) // 순서대로 정렬되있을시 알맞은 위치에 값넣기
{
    int i = a->length - 1;
    if (a->length >= a->size)
        return;
    for (i; i >= 0; i--)
    {
        if (a->a[i] > x)
            a->a[i + 1] = a->a[i];
        else
        break;
        
    }
    //while (i >= 0 && a->a[i] > x)
    //{
    //    a->a[i + 1] = a->a[i];
    //    i--;
    //}
    a->a[i + 1] = x;
    a->length++;
}
 
bool isSorted(a a) // 값이 정령되어있는지
{
    for (int i = 0; i < a.length - 1; i++)
    {
        if (a.a[i] > a.a[i + 1])
            return false;
    }
    return true;
}
 
void Rearrange(a* a) // 음수 재정렬
{
    int i, j;
    i = 0;
    j = a->length - 1;
 
    while (i < j)
    {
        while (a->a[i] < 0)i++;
        while (a->a[j] >= 0)j--;
        if (i < j) swap123(&a->a[i], &a->a[j]);
    }
}
 
a* Marge(struct a* a, struct a* b) // 두개의 배열을 합치다
{
    int i, j, k;
    i = j = k = 0;
 
    struct a* c = new struct a();
    while (i < a->length && j < b->length)
    {
        if (a->a[i] < b->a[j])
            c->a[k++] = a->a[i++];
        else
            c->a[k++] = b->a[j++];
    }
    for (; i < a->length; i++)
        c->a[k++] = a->a[i];
    for (; j < b->length; j++)
        c->a[k++] = b->a[j];
    c->length = a->length + b->length;
    c->size = 10;
    return c;
}
 
a* Union(struct a* a, struct a* b) //합집합
{
    int i, j, k;
    i = j = k = 0;
 
    struct a* c = new struct a();
    while (i < a->length && j < b->length)
    {
        if (a->a[i] < b->a[j])
            c->a[k++] = a->a[i++];
        else if (a->a[i] > b->a[j])
            c->a[k++] = b->a[j++];
        else 
        {
            c->a[k++] = a->a[i++];
            j++;
        }
    }
    for (; i < a->length; i++)
        c->a[k++] = a->a[i];
    for (; j < b->length; j++)
        c->a[k++] = b->a[j];
    c->length = k;
    c->size = 10;
    return c;
}
 
a* Intersection(struct a* a, struct a* b) //교집합
{
    int i, j, k;
    i = j = k = 0;
 
    struct a* c = new struct a();
    while (i < a->length && j < b->length)
    {
        if (a->a[i] < b->a[j])
            i++;
        else if (a->a[i] > b->a[j])
            j++;
        else if (a->a[i] == b->a[j])
        {
            c->a[k++] = a->a[i++];
            j++;
        }
    }
    c->length = k;
    c->size = 10;
    return c;
}
 
a* Difference(struct a* a, struct a* b) //
{
    int i, j, k;
    i = j = k = 0;
 
    struct a* c = new struct a();
    while (i < a->length && j < b->length)
    {
        if (a->a[i] < b->a[j])
            c->a[k++] = a->a[i++];
        else if (a->a[i] > b->a[j])
            j++;
        else
        {
            i++;
            j++;
        }
    }
    for (; i < a->length; i++)
        c->a[k++] = a->a[i];
    
    c->length = k;
    c->size = 10;
    return c;
}
 
int main()
{
    /*struct a a = { {2,6,10,15,25},10,5 };
    struct a b = { {3,6,7,15,20},10,5 };
    struct a* c{};*/
    int x, index,ch=0;
    struct a a1;
    a1.length = 0;
    cout << "사이즈를 입력하세요\n";
    cin >> a1.size;
    a1.a = new int[a1.size];
 
    while (ch < 3)
    {
        cout << "1 인덱스 삽입\n" << "2화면에 보이기 \n";
        cin >> ch;
        switch (ch)
        {
        case 1:
            cout << "넣을 위치 값을 입력\n";
            cin >> index >> x;
            insert(a1, index, x);
            break;
        case 2:
            Display(a1);
        }
    }
    
    /*c = Difference(&a, &b);
    Display(*c);*/
    /*int n;
    cin >> a.size;
    a.a = new int[a.size];
    a.length = 0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a.a[i];    
    }
    a.length = n;*/
    //Rearrange(&a);
    ////add(&a, 12);
    ////add(&a, 12);
    ////add(&a, 12);
    //
    ////delete1(a, 1);
    //Display(a);
    //cout << a.length;
    /*cout<< Lineserach(a, 3);
    Display(a);*/
    /*cout << BinarySearch(a, 6);
    cout << RBS(a,0,a.length-1,12);*/
    /*Set(&a, 2, 5);
    cout<<Get(a, 2);*/
    /*cout << Max(a);
    cout << Min(a);
    
    cout << Avg(a);*/
    /* Reverse2(&a);
     Display(a);*/
     /*c = Merge(&a, &b);
    Display(*c);*/
 
    /*int i =0 ,j = 0;
    while (i < 5 && j < 5)
    {
        i++;
        j += 2;
    }
    cout << i << j << endl;
 
    i = j = 0;
    while (1)
    {
        if (i > 5 && j > 5)
            break;
        i++;
        j += 2;
    }
    cout << i << j << endl;*/
 
    /*int d = 0;
    while (d > -1 && d < 10)
    {
        d++;
    }
    cout << d;*/
    return 0;
}

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;
 
class arr {
private:
    int* a;
    int size;
    int length;
    void swap123(int* x, int* y) // 위치 변경
    {
        int temp = *x;
        *x = *y;
        *y = temp;
    }
public:
    arr()
    {
        size = 10;
        length = 0;
        a = new int[size];
    }
    arr(int sz)
    {
        size = sz;
        length = 0;
        a = new int[size];
    }
    ~arr()
    {
        delete[] a;
        
    }
 
void Display();
 
void add(int x) // 맨뒤에 삽입
{
    a[length++] = x; //값을 넣은 후 ++됨
}
void insert(int idx, int data) // 원하는곳에 삽입
{
    for (int i = length; i > idx; i--)
    {
        a[i] = a[i - 1];
    }
    
    ++length;
}
void delete1(int index) // 삭제
{
    for (int i = index; i < length-1; i++)
    {
        a[i] = a[i + 1];
    }
    length--;    
}
int Lineserach(int data) // 라인서치 O(N)
{
    for (int i = 0; i < length; i++)
    {
        if (a[i] == data)
        {
            swap123(&a[i], &a[i - 1]);
            return i; //인덱스 i에 있다.
        }
    }
    return -1; //찾지 못하겠다.
}
 
int BinarySearch(int key) // 이진탐색
{
    int low, mid, h;
    low = 0;
    h = length - 1;
 
    while (low <= h)
    {
        mid = (low + h) / 2;
        if (key == a[mid])
        {
            return mid;
        }
        else if (key > a[mid])
        {
            low = mid + 1;
        }
        else
        {
            h= mid - 1;
        }
    }
    return -1;
}
int RBS(int low, int h, int key) //재귀버전 이진탐색
{
    int mid;
    while (low <= h)
    {
         mid = (low + h) / 2;
        if (key == a[mid])
        {
            return mid;
        }
        else if (key > a[mid])
        {
            return RBS( mid + 1, h, key);
        }
        else
            return RBS(low, mid - 1, key);
    }
    return -1;
}
 
int Get(int index) //값을 얻다
{
    if (index >= 0 && index < length)
        return a[index];
    return -1;
}
 
void Set(int index,int x) // 값을 설정
{
    if (index >= 0 && index < length)
        a[index] = x;
}
 
int Max() // 최댓값
{
    int max = a[0];
    for (int i = 0; i < length; i++)
    {
        if (a[i] > max)
            max = a[i];
    }
    return max;
}
 
int Min() //최소값
{
    int min = a[0];
    for (int i = 0; i < length; i++)
    {
        if (a[i] < min)
            min = a[i];
    }
    return min;
}
int& Sum() //합
{
    int total = 0;
    for (int i = 0; i < length; i++)
        total += a[i];
 
    return total;
}
 
float Avg() //평균
{
    /*int avg = 0;
    avg = Sum(a) / a.length;
    return (float)avg;*/
 
    return (float)Sum() / length;
}
 
void Reverse() //거꾸로 뒤집다
{
    int* b;
    int i, j;
    b = new int[length];
    for ( i = 0,  j = length - 1; j >= 0; i++, j--)
    {
        b[j] = a[i];
    }
    for (int i = 0; i < length; i++)
    {
        a[i] = b[i];
    }
    delete[] b;
}
void Reverse2() // 두번째 방법
{
    int i, j;
    for (i = 0, j = length - 1; i <= j; i++, j--)
    {
        swap123(&a[i], &a[j]);
    }
}
void InsertSort(int x) // 순서대로 정렬되있을시 알맞은 위치에 값넣기
{
    int i = length - 1;
    if (length >= size)
        return;
    for (i; i >= 0; i--)
    {
        if (a[i] > x)
            a[i + 1] = a[i];
        else
        break;
        
    }
    //while (i >= 0 && a->a[i] > x)
    //{
    //    a->a[i + 1] = a->a[i];
    //    i--;
    //}
    a[i + 1] = x;
    length++;
}
 
bool isSorted() // 값이 정령되어있는지
{
    for (int i = 0; i < length - 1; i++)
    {
        if (a[i] > a[i + 1])
            return false;
    }
    return true;
}
 
void Rearrange() // 음수 재정렬
{
    int i, j;
    i = 0;
    j = length - 1;
 
    while (i < j)
    {
        while (a[i] < 0)i++;
        while (a[j] >= 0)j--;
        if (i < j) swap123(&a[i], &a[j]);
    }
}
 
arr* Marge(arr& b) // 두개의 배열을 합치다
{
    int i, j, k;
    i = j = k = 0;
 
     arr* c = new arr(length + b.length);
    while (i < length && j < b.length)
    {
        if (a[i] < b.a[j])
            c->a[k++] = a[i++];
        else
            c->a[k++] = b.a[j++];
    }
    for (; i < length; i++)
        c->a[k++] = a[i];
    for (; j < b.length; j++)
        c->a[k++] = b.a[j];
    c->length = length + b.length;
    c->size = 10;
    
    return c;
}
 
arr* Union(arr* b) //합집합
{
    int i, j, k;
    i = j = k = 0;
 
     arr* c = new arr(length+b->length);
    while (i < length && j < b->length)
    {
        if (a[i] < b->a[j])
            c->a[k++] = a[i++];
        else if (a[i] > b->a[j])
            c->a[k++] = b->a[j++];
        else 
        {
            c->a[k++] = a[i++];
            j++;
        }
    }
    for (; i < length; i++)
        c->a[k++] = a[i];
    for (; j < b->length; j++)
        c->a[k++] = b->a[j];
    c->length = k;
    c->size = 10;
    return c;
}
 
arr* Intersection(arr* b) //교집합
{
    int i, j, k;
    i = j = k = 0;
 
     arr* c = new arr(length + b->length);
    while (i < length && j < b->length)
    {
        if (a[i] < b->a[j])
            i++;
        else if (a[i] > b->a[j])
            j++;
        else if (a[i] == b->a[j])
        {
            c->a[k++] = a[i++];
            j++;
        }
    }
    c->length = k;
    c->size = 10;
    return c;
}
 
arr* Difference(arr* b) //
{
    int i, j, k;
    i = j = k = 0;
 
     arr* c = new arr(length + b->length);
    while (i < length && j < b->length)
    {
        if (a[i] < b->a[j])
            c->a[k++] = a[i++];
        else if (a[i] > b->a[j])
            j++;
        else
        {
            i++;
            j++;
        }
    }
    for (; i < length; i++)
        c->a[k++] = a[i];
    
    c->length = k;
    c->size = 10;
    return c;
}
};
 
void arr::Display() // 출력
{
    for (int i = 0; i < length; i++)
    {
        cout << a[i] << " ";
    }
    cout << endl;
}
int main()
{
    /*struct a a = { {2,6,10,15,25},10,5 };
    struct a b = { {3,6,7,15,20},10,5 };
    struct a* c{};*/
    int x, index,ch=0;
    class arr a1(10);
    class arr a2(10);
    class arr* a3;
    cout << "사이즈를 입력하세요\n";
    a1.add(-1);
    a2.add(-2);
    
    a3 = a1.Difference(&a2);
    a3->Display();
    //while (ch < 3)
    //{
    //    cout << "1 인덱스 삽입\n" << "2화면에 보이기 \n";
    //    cin >> ch;
    //    switch (ch)
    //    {
    //    case 1:
    //        cout << "넣을 위치 값을 입력\n";
    //        cin >> index >> x;
    //        a1.insert(index, x);
    //        break;
    //    case 2:
    //        a1.Display();
    //    }
    //}
    
    /*c = Difference(&a, &b);
    Display(*c);*/
    /*int n;
    cin >> a.size;
    a.a = new int[a.size];
    a.length = 0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a.a[i];    
    }
    a.length = n;*/
    //Rearrange(&a);
    ////add(&a, 12);
    ////add(&a, 12);
    ////add(&a, 12);
    //
    ////delete1(a, 1);
    //Display(a);
    //cout << a.length;
    /*cout<< Lineserach(a, 3);
    Display(a);*/
    /*cout << BinarySearch(a, 6);
    cout << RBS(a,0,a.length-1,12);*/
    /*Set(&a, 2, 5);
    cout<<Get(a, 2);*/
    /*cout << Max(a);
    cout << Min(a);
    
    cout << Avg(a);*/
    /* Reverse2(&a);
     Display(a);*/
     /*c = Merge(&a, &b);
    Display(*c);*/
 
    /*int i =0 ,j = 0;
    while (i < 5 && j < 5)
    {
        i++;
        j += 2;
    }
    cout << i << j << endl;
 
    i = j = 0;
    while (1)
    {
        if (i > 5 && j > 5)
            break;
        i++;
        j += 2;
    }
    cout << i << j << endl;*/
 
    /*int d = 0;
    while (d > -1 && d < 10)
    {
        d++;
    }
    cout << d;*/
    return 0;
}