按选择法将数组num的元素值按从低到高排序 #1

Merged
pn8rjlxip merged 1 commits from pe4c6pn3v/System:master into master 2 years ago

36.void AsSortbyNum(STU stu[], int n, int m)
37.{
38. int i, j, k, t;
39. for (i=0; i<n-1; i++)
40. {
41. k = i;
42. for (j=i+1; j<n; j++)
43. {
44. if (stu[j].num < stu[k].num) k = j;
45. }

36.void AsSortbyNum(STU stu[], int n, int m) 37.{ 38. int i, j, k, t; 39. for (i=0; i<n-1; i++) 40. { 41. k = i; 42. for (j=i+1; j<n; j++) 43. { 44. if (stu[j].num < stu[k].num) k = j; 45. }
pe4c6pn3v added 1 commit 2 years ago
pn8rjlxip merged commit 0a07643564 into master 2 years ago
The pull request has been merged as 0a07643564.
Sign in to join this conversation.
No reviewers
No Label
No Milestone
No project
No Assignees
1 Participants
Notifications
Due Date

No due date set.

Dependencies

No dependencies set.

Reference: pn8rjlxip/System#1
Loading…
There is no content yet.