一个可读出某一目录下所有文件名并删除创建 C++编写 vc++ 6.0（国外英文资料）.docVIP

一个可读出某一目录下所有文件名并删除创建 C++编写 vc++ 6.0（国外英文资料） # include stdafx. H # include iostream # include string # include fstream # include direct.h # include IO. H Using namespace STD. Struct Node { Char a, [260]. Struct Node * next; }; Void the Create (char * a) { The FILE * fp. Fp = fopen (a, w); If (fp = = NULL) { Cout create failure! endl; } The else { Cout create success! endl; The fclose (fp); } } String StringInput () { Strings str1; Getline (cin, str1); Int b; B = str1.length (); If ((char) str1 [b-1] = = 92) Return the str1; The else { Cout path format error! endl; Return NULL; } } Struct Node * SelectSort (struct Node * head) { Struct Node * first; / * the list of headers in the ordered chain Struct Node * tail; / * the tail pointer of the ordered chain after the permutation Struct Node * p_min; / * the pointer to the forward node of a smaller node Struct Node * min; / * stores the minimum node * / Struct Node * p; / * the current comparison node * / The first = NULL; While (head! = NULL) / * look for the node with the smallest key value in the list. * / { / * note: the for statement here is where you choose to sort your thoughts For (p = head, min = head; p- next! = NULL; p = p next) / * loop through the nodes in the linked list to find the smallest node at this point. * / { If (p - next - a, min- a) 0) / * find a node smaller than the current min. * / { P_min = p; / * save the forward node of the node: clearly the prodrome of the p- next is p. * / Min = p- next; / * save the smaller nodes. * / } } / * when the above for statement is over, two things will be done. One is to put it in an ordered list; Secondly, according to the relevant conditions, arrange it to leave the original linked list. * / / * first thing * / If (first = = NULL) / * if the ordered list is currently an empty linked list * / { The first = min; / * first find the node with the lowest key value. * / Tail = min; / * note: the tail pointer makes it point to the last node. * /