#include
#include
using namespace std;
void insertion(char p[], int n);
void ispis(char p[], int n);
int main()
{ const int vel=12;
char niz[vel]={'E','A','S','Y','Q','U','E','S','T','I','O','N'};
cout<<"Nesortirana lista:"<
insertion(niz,vel);
cout<<"Sortirana lista:"<
return 0;}
void insertion(char p[], int n)
{ for(int i=1; i
int walker=i;
int tmp=p[i];
while(walker>0 && tmp
{ p[walker]=p[walker-1];
walker--; }
p[walker]=tmp; }
return; }
void ispis(char p[], int n)
{ for(int i=0; i
cout<
}
Post je objavljen 03.04.2013. u 00:17 sati.