User talk:Vvhoangqb


 * 1) include
 * 2) include
 * 3) include

struct LinkedList {	int data; LinkedList *link; };

LinkedList *Back(LinkedList *l,LinkedList *p) {	LinkedList *q=l; if (l != NULL) while (q->link != p && q->link != NULL) q=q->link; if (q->link==NULL) return NULL; else return q; }

LinkedList *Bottom(LinkedList *l) {	LinkedList *q=l; if (l != NULL) while (q->link != NULL) q=q->link; return q; }

void InputLIFO(LinkedList *&l) {	int n,x; LinkedList *a; l=NULL; printf("So phan tu cua danh sach: "); scanf("%d",&n); printf("Nhap du lieu vao danh sach : \n"); for(int i=0;idata=x; a->link=l; l=a; } }

void InputFIFO(LinkedList *&l) {	int n,x; LinkedList *a; l=NULL; printf("So phan tu cua danh sach: "); scanf("%d",&n); printf("Nhap du lieu vao danh sach : \n"); for(int i=0;idata=x; if (l==NULL) {			a->link=l; l=a; }		else {			Bottom(l)->link=a; a->link=NULL; }	} }

void InsertNext(LinkedList *l,LinkedList *p, int x) { LinkedList *a; a=new LinkedList; a->data=x; if (l==NULL) {		a->link=l; l=a; }	else {		Back(l,p)->link=a; a->link=p; } }

void InsertBack(LinkedList *l,LinkedList *p, int x) { LinkedList *a; a=new LinkedList; a->data=x; if (l==NULL) {		a->link=l; l=a; }	else {		Back(l,p)->link=a; a->link=p; } }

void Output(LinkedList *l) {	LinkedList *p=l; printf("Cac phan tu trong danh sach : "); while(p != NULL) {		printf("%d",p->data); if (p->link!=NULL) printf("; "); p=p->link; }	printf("\n"); }

void AssortUp(LinkedList *l) {	LinkedList *p=l; while(p->link != NULL) {		LinkedList *q=p->link; while(q != NULL) {			if (q->datadata) {				int temp=q->data; q->data=p->data; p->data=temp; }			q=q->link; }		p=p->link; } }

void AssortDown(LinkedList *l) {	LinkedList *p=l; while(p->link != NULL) {		LinkedList *q=p->link; while(q != NULL) {			if (q->data > p->data) {				int temp=q->data; q->data=p->data; p->data=temp; }			q=q->link; }		p=p->link; } }

int Testsort(LinkedList *l) {	int status=1; LinkedList *p=l; if (p->link->link != NULL) {		if ((Bottom(l)->data - p->data)>0) {			while(p->link != NULL) {				if ((p->link->data - p->data)<0) return 0; p=p->link; }		}		else {			while(p->link !=NULL) {				if ((p->link->data - p->data)>0) return 0; p=p->link; }		}	}	return status; }

void InsertOrder(LinkedList *l, int x) { LinkedList *p,*q; p=new LinkedList; p->data=x; q=l; if((Bottom(l)->data - q->data)>0) {		if(q->data > x)		{ p->link=q; l = p;		} else if(Bottom(l)->data < x)			{ p->link=Bottom(l)->link; Bottom(l)->link=p; }			else {				while(q->link->data < x)					q=q->link; p->link=q->link; q->link=p; }	}	else if(q->data < x)		{ p->link=q; l = p;		} else if(Bottom(l)->data > x)			{ p->link=Bottom(l)->link; Bottom(l)->link=p; }			else {				while(q->link->data > x)					q=q->link; p->link=q->link; q->link=p; } }

LinkedList *Search(LinkedList *l, int num) {	LinkedList *p=l; LinkedList *q=NULL; if ((Bottom(l)->data - l->data)>0) {		while(p->data < num && p->link != NULL) p=p->link; if (p->data==num) q = p;	} else {		while(p->data > num && p->link != NULL) p=p->link; if (p->data==num) q = p;	} return q; }

void Delete(LinkedList *l,LinkedList *p) {	if (p==l) {		l=p->link; delete(p); }	else if(p->link==NULL) {			Back(l,p)->link=NULL; delete(p); }		else {			Back(l,p)->link=p->link; delete(p); } }

void InputUp(LinkedList *&l) {	int n,x; LinkedList *a; l=NULL; printf("So phan tu cua danh sach: "); scanf("%d",&n); printf("Nhap du lieu vao danh sach : \n"); for(int i=0;idata=x; if (l==NULL || l->data>x) {			a->link=l; l=a; }		else {				LinkedList *p=l; while(p->link!=NULL && p->datalink; if (p->link==NULL) {					a->link=NULL; p->link=a; }				else {					a->link=p->link; p->link=a; }			}	} }

void Discard(LinkedList *l) {	LinkedList *p=l; while(p->link != NULL) {		LinkedList *q=p->link; if(p->data == q->data) Delete(l,q); else p=p->link; } }

void Invert(LinkedList *l) { }

void main {	LinkedList *l; l=new LinkedList; //	int num; InputUp(l); //AssortUp(l); Output(l); //Discard(l); //Output(l); //printf("Nhap phan tu can xoa : "); //scanf("%d",&num); //if (Search(l,num) != NULL) //{	//	Delete(l,Search(l,num)); //	Output(l); //}	//else printf("Khong tim thay %d trong dang sach!\n",num); getch; }

License tagging for Image:H-K-T-C.01.jpg
Thanks for uploading Image:H-K-T-C.01.jpg. Wikipedia gets thousands of images uploaded every day, and in order to verify that the images can be legally used on Wikipedia, the source and copyright status must be indicated. Images need to have an image tag applied to the image description page indicating the copyright status of the image. This uniform and easy-to-understand method of indicating the license status allows potential re-users of the images to know what they are allowed to do with the images.

For more information on using images, see the following pages:
 * Image use policy
 * Image copyright tags

This is an automated notice by OrphanBot. If you need help on selecting a tag to use, or in adding the tag to the image description, feel free to post a message at Media copyright questions. 16:09, 29 September 2007 (UTC)