Selection Sort with stack and queue

Selection Sort :7 1 4 2------>1 2 4 7

stack way

#include<stdio.h>
#define MAX 100
int N=0;
typedef int elemtype;
int s[MAX];
int head=0;
int tail;
int is_empty()
{
	return N==0;
}
void enqueue(char ch)
{
	s[N++]=ch;
	tail=N;
}
int dequeue()
{
	if(is_empty())
		return -1;
	else
	{
		
		printf("%c",s[head]);
		head=head+1;
	}
}
int less(int w,int v)
{
	if(s[w]<s[v]||s[w]==s[v])
		return 1;
	return 0;
}
void exchange(int ix, int min)
{
	elemtype temp;
	
	temp=s[min];
	s[min]=s[ix];
	s[ix]=temp;
}
void sort()
{
	for(int i=0;i<N;i++)
	{
		int min=i;
		for(int j=i+1;j<N;j++)
		{
			if(less(j,min))
				min=j;
		}
		exchange(i,min);//交换两个位置的元素
	}
	
}
void main()
{
		elemtype num;

	while(1)
	{
		scanf("%d",&num);
		if(num==-1)
			break;
		enqueue(num);
	}
	sort();
	for(int i=0;i<N;i++)
		printf("%d ",s[i]);
}

Queue way

#include<stdio.h>
#define MAX 100
int N=0;
typedef int elemtype;
int s[MAX];
int head=0;
int tail;
int is_empty()
{
	return N==0;
}
void enqueue(char ch)
{
	s[N++]=ch;
	tail=N;
}
int dequeue()
{
	if(is_empty())
		return -1;
	else
	{
		
		printf("%c",s[head]);
		head=head+1;
	}
}
int less(int w,int v)
{
	if(s[w]<s[v]||s[w]==s[v])
		return 1;
	return 0;
}
void exchange(int ix, int min)
{
	elemtype temp;
	
	temp=s[min];
	s[min]=s[ix];
	s[ix]=temp;
}
void sort()
{
	for(int i=0;i<N;i++)
	{
		int min=i;
		for(int j=i+1;j<N;j++)
		{
			if(less(j,min))
				min=j;
		}
		exchange(i,min);//交换两个位置的元素
	}
	
}
void main()
{
		elemtype num;

	while(1)
	{
		scanf("%d",&num);
		if(num==-1)
			break;
		enqueue(num);
	}
	sort();
	for(int i=0;i<N;i++)
		printf("%d ",s[i]);
}

stack way with point

#include<stdio.h>
#include<stdlib.h>
typedef int eletype;

typedef struct node_s {
	eletype data;
	struct node_s *next;
}node_t,*node_ptr_t;

node_ptr_t first;
	
int isEmpty()
{
	return first->next==NULL;
}
node_ptr_t new_node()
{
	node_ptr_t p=(node_ptr_t)malloc(sizeof(node_t));
	p->next=NULL;
	return p;
}
void push(eletype c)
{
	node_ptr_t oldfirst=first;
	first = new_node();
	first->data=c;
	first->next=oldfirst;
}
void pop()
{
	eletype temp=first->data;
	first=first->next;
	printf("%d ",temp);
}
void exchange(node_ptr_t p,node_ptr_t q)
{
	int temp;
	temp=p->data;
	p->data=q->data;
	q->data=temp;
}
int less(node_ptr_t p,node_ptr_t q)
{
	if(p->data<q->data||p->data==q->data)
		return 1;
	else
		return 0;
}
void sort()
{
	for(node_ptr_t i=first;i->next!=NULL;i=i->next)
	{
		node_ptr_t min=i;
		for(node_ptr_t j=first->next;j->next!=NULL;j=j->next)
			if(less(j,min))
				min=j;
		exchange(i,min);
		
	}
}

void main()
{
	
	eletype num;

	while(1)
	{
		scanf("%d",&num);
		if(num==-1)
			break;
		push(num);
	}
	sort();
	while(first)
		pop();
}