반응형
[선형리스트 - Stack]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
#include <stdio.h>
#define MAX_STACK 10
#define STACK_EMPTY MAX_STACK
#define STACK_FULL 0
int Push_Stack(int data);
int Pop_Stack(int *p);
int Print_Stack(void);
int Count_Full_Data_Stack(void);
int Count_Empty_Data_Stack(void);
int a[MAX_STACK+1] = {1,2,3,4,5,6,7,8,9,10,11};
int Stack[MAX_STACK];
int Sptr = STACK_EMPTY;
int Print_Stack(void)
{
int i;
for(i = Sptr; i < MAX_STACK; i++)
{
printf("STACK[%d] = %d\n", i, Stack[i]);
}
return MAX_STACK - Sptr;
}
int Count_Full_Data_Stack(void)
{
return STACK_EMPTY - Sptr;
}
int Count_Empty_Data_Stack(void)
{
return Sptr - STACK_FULL;
}
int Push_Stack(int data)
{
if(Sptr == STACK_FULL) return -1;
Stack[--Sptr] = data;
return 1;
}
int Pop_Stack(int *p)
{
if(Sptr == STACK_EMPTY) return -1;
*p = Stack[Sptr++];
return 1;
}
|
cs |
[선형리스트 - Linear Queue]
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
#include <stdio.h>
#define MAX_Q 5
#define Q_EMPTY 0
#define Q_FULL MAX_Q
int In_Queue(int data);
int Out_Queue(int *p);
int Print_Queue(void);
int Count_Full_Data_Queue(void);
int Count_Empty_Data_Queue(void);
int a[MAX_Q+1] = {1,2,3,4,5,6};
int Queue[MAX_Q];
int Wrptr = Q_EMPTY;
int Rdptr = Q_EMPTY;
int Print_Queue(void)
{
int i;
for(i=Rdptr; i<Wrptr; i++)
{
printf("Queue[%d] = %d\n", i, Queue[i]);
}
return Wrptr - Rdptr;
}
int Count_Full_Data_Queue(void)
{
return Wrptr - Rdptr;
}
int Count_Empty_Data_Queue(void)
{
return MAX_Q - (Wrptr - Rdptr);
}
void main(void)
{
}
int In_Queue(int data)
{
int i;
if(Wrptr == Q_FULL)
{
if(Rdptr == Q_EMPTY)
{
return -1;
}
for(i=0; i<(Wrptr-Rdptr); i++)
{
Queue[i] = Queue[Rdptr + i];
}
Wrptr -= Rdptr;
Rdptr = Q_EMPTY;
}
Queue[Wrptr++] = data;
return 1;
}
int Out_Queue(int *p)
{
if(Rdptr == Wrptr) return -2;
*p = Queue[Rdptr++];
return 1;
}
|
cs |
[선형리스트 - Circular Queue]
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
#include <stdio.h>
#define MAX_Q 8
#define Q_MIN 0
#define Q_MAX MAX_Q
int In_Queue(int data);
int Out_Queue(int *p);
int Print_Queue(void);
int Count_Full_Data_Queue(void);
int Count_Empty_Data_Queue(void);
int a[MAX_Q+1] = {1,2,3,4,5,6,7,8,9};
int Queue[MAX_Q];
int Wrptr = Q_MIN;
int Rdptr = Q_MIN;
int Print_Queue(void)
{
int i;
int rd = Rdptr;
int n = Count_Full_Data_Queue();
for(i=0; i<n; i++)
{
printf("Queue[%d] = %d\n", rd, Queue[rd++]);
rd %= MAX_Q;
}
return n;
}
int Count_Full_Data_Queue(void)
{
if(Rdptr > Wrptr) return MAX_Q - (Rdptr - Wrptr);
return Wrptr - Rdptr;
}
int Count_Empty_Data_Queue(void)
{
return MAX_Q - Count_Full_Data_Queue() - 1;
}
int In_Queue(int data)
{
if(((Wrptr + 1) % MAX_Q) == Rdptr)
{
return -1;
}
Queue[Wrptr++] = data;
Wrptr %= MAX_Q;
return 1;
}
int Out_Queue(int *p)
{
if(Rdptr == Wrptr)
{
return -2;
}
*p = Queue[Rdptr++];
Rdptr %= MAX_Q;
return 1;
}
|
cs |
반응형
'알고리즘 문제풀이' 카테고리의 다른 글
| [CS] Quick Sort (0) | 2020.10.07 |
|---|---|
| [CS] Stack, Queue (Heap기반) (0) | 2020.10.07 |
| [Hash] Chainning 방식 (0) | 2020.10.07 |
| [Hash]Open Address 방식 (0) | 2020.10.07 |
| [Heap]Heap Sort (0) | 2020.10.07 |