人事管理系统 c语言版_人事信息管理系统c

int menu(){
printf(“请按提示输入完成操作！\n”);
printf(“1.查询员工信息\n”);
printf(“2.统计员工数量\n”);
printf(“3.录入员工信息\n”);
printf(“4.删除员工信息\n”);
printf(“5.按id排序所有员工\n”);
printf(“6.打印所有员工信息\n”);
printf(“7.退出系统\n”);
return 0;

}

如menu()函数所示，该系统一共有7个功能

1. #include <stdio.h>

2. #include <stdlib.h>

3. #include <string.h>

5. struct emp{

6. int id;

7. char name[50];

8. struct emp * next;

10. };

12. struct emp * initList();

14. struct emp * addListTailNode(struct emp * head);

16. struct emp * deleteListNode(struct emp * head,int id);

18. struct emp * searchEmp(struct emp * head,int id);

20. int printList(struct emp * l);

22. int printNode(struct emp * p);

24. struct emp * sortList(struct emp * head);

26. int getListLen(struct emp * head);

28. int writeToDisk(struct emp * head);

30. struct emp * readFromDisk();

32. int menu();

34. int usage(struct emp * head);

1. #include “emp.h”

3. int main(){

4. struct emp * head;

5. head=readFromDisk();

6. usage(head);

7. return 0;

8. }

10. struct emp * initList(){

11. struct emp * head;

12. head=(struct emp *)malloc(sizeof(struct emp));

13. head->next=NULL;

14. return head;

15. }

17. struct emp * addListTailNode(struct emp * head){

18. int id;

19. char name[50];

20. struct emp * p, * last , * check;

21. last = head;

22. while(last->next!=NULL){

23. last=last->next;

24. }

25. printf(“依次输入：员工id号，姓名!\n”);

26. scanf(“%d%s”,&id,&name);

27. check = head;

28. while(check!=last){

29. check=check->next;

30. if(id==check->id){

31. printf(“添加失败！员工id号重复！\n”);

32. return head;

33. }

34. }

35. p=(struct emp *)malloc(sizeof(struct emp));

36. p->id=id;

37. strcpy(p->name,name);

39. last->next=p;

40. last=p;

41. p->next=NULL;

42. printf(“%s员工信息已添加!\n”,p->name);

43. return head;

44. }

46. struct emp * deleteListNode(struct emp * head,int id){

47. struct emp * p,* q;

48. p = head->next;

49. while(p!=NULL){

50. if(p->next->id==id){

51. break;

52. }

53. p=p->next;

54. }

55. if(head->next==NULL){

56. printf(“书籍信息为空！删除失败！\n”);

57. }

58. else{

59. q = p->next;

60. p->next = q->next;

61. printf(“%s书籍信息被删除！\n”,q->name);

62. free(q);

63. }

64. return head;

65. }

67. struct emp * searchEmp(struct emp * head,int id){

68. struct emp * p;

69. p = head->next;

70. while(p!=NULL){

71. if(p->id==id){

72. break;

73. }

74. p=p->next;

75. }

76. return p;

77. }

79. int printNode(struct emp * p){

80. if(p!=NULL){

81. printf(“员工id: %d 员工姓名：%s\n”,p->id,p->name);

82. }

83. else{

84. printf(“系统内无该员工信息！\n”);

85. }

86. return 0;

87. }

89. int printList(struct emp * head){

90. struct emp * p;

91. p = head->next;

92. while(p!=NULL){

93. printNode(p);

94. p=p->next;

95. }

96. return 0;

97. }

99. struct emp * sortList(struct emp * head){

100. struct emp * p,* q;

101. int temp_id;

102. char temp_name[50];

103. for(p=head->next;p!=NULL;p=p->next){

104. for(q=p->next;q!=NULL;q=q->next){

105. if(p->id>q->id){

106. temp_id = q->id;

107. q->id = p->id;

108. p->id = temp_id;

110. strcpy(temp_name,q->name);

111. strcpy(q->name,p->name);

112. strcpy(p->name,temp_name);

113. }

114. }

115. }

116. return head;

117. }

119. int getListLen(struct emp * head){

120. int len=0;

121. struct emp * p;

122. p=head->next;

123. while(p!=NULL){

124. len++;

125. p=p->next;

126. }

127. return len;

128. }

130. int writeToDisk(struct emp * head){

131. FILE * fp;

132. struct emp * p;

133. if((fp = fopen(“D:\\emp.hhtx”, “w”)) == 0){

134. printf(“写入失败……!\n”);

135. return 0;

136. }

138. p=head->next;

139. while(p!=NULL){

140. fwrite(p,sizeof(struct emp),1,fp);

141. printf(“%d %s\n”,p->id,p->name);

142. p=p->next;

143. }

144. fclose(fp);

145. return 0;

146. }

148. struct emp * readFromDisk(){

149. FILE * fp;

150. struct emp * head,* last,* p,* temp;

151. head = initList();

152. if((fp = fopen(“D:\\emp.hhtx”, “r”)) == 0){

153. printf(“加载失败……未找到存档数据!\n\n”);

154. return head;

155. }

157. last = head;

158. p=(struct emp *)malloc(sizeof(struct emp));

159. while(p!=NULL){

160. p=(struct emp *)malloc(sizeof(struct emp));

161. fread(p,sizeof(struct emp),1,fp);

162. printf(“读取数据: %d %s\n”,p->id,p->name);

164. last->next=p;

165. last=p;

166. p=p->next;

167. }

168. fclose(fp);

169. printf(“系统数据初始化完成！”);

170. return head;

171. }

173. int menu(){

174. printf(“请按提示输入完成操作！\n”);

175. printf(“1.查询员工信息\n”);

176. printf(“2.统计员工数量\n”);

177. printf(“3.录入员工信息\n”);

178. printf(“4.删除员工信息\n”);

179. printf(“5.按id排序所有员工\n”);

180. printf(“6.打印所有员工信息\n”);

181. printf(“7.退出系统\n”);

182. return 0;

183. }

185. int usage(struct emp * head){

186. int x,id;

187. struct emp * p;

188. menu();

189. while(1){

190. printf(“请输入序列号：”);

191. scanf(“%d”,&x);

192. switch(x){

193. case 1:

194. printf(“输入所要查询的员工的id号：”);

195. scanf(“%d”,&id);

196. p = searchEmp(head,id);

197. printNode(p);

198. printf(“———————————\n”);

199. break;

200. case 2:

201. printf(“系统中一共存在%d个员工\n”,getListLen(head));

202. break;

203. case 3:

204. head=addListTailNode(head);

205. printf(“———————————\n”);

206. break;

207. case 4:

208. printf(“输入所要删除的员工的id号：”);

209. scanf(“%d”,&id);

210. head=deleteListNode(head,id);

211. printf(“———————————\n”);

212. break;

213. case 5:

214. printf(“排序开始……\n”);

215. head=sortList(head);

216. printf(“排序已完成！\n”);

217. printf(“———————————\n”);

218. break;

219. case 6:

220. printList(head);

221. printf(“———————————\n”);

222. break;

223. case 7:

224. writeToDisk(head);

225. printf(“保存完成……\n”);

226. printf(“已退出系统!\n”);

227. printf(“———————————\n”);

228. return 0;

229. default:

230. return 0;

231. }

232. }

233. return 0;

234. }