StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POHow to choose the best marks with specified credits in c programming?
primarykey
Id
20745726
data
AcceptedAnswerId
20771551
AnswerCount
3
ClosedDate
CommentCount
9
CommunityOwnedDate
CreationDate
2013-12-23T14:41:04.473
FavoriteCount
0
LastActivityDate
2013-12-25T10:07:37.567
LastEditDate
2013-12-25T03:57:00.277
LastEditorUserId
3129816
OwnerUserId
3129816
ParentId
0
PostTypeId
1
Score
1
ViewCount
202
LastEditorDisplayName
text
Body
I want to make a program to get the weighted average (<code>formula = (mark*(credits corresponds to it))/total credits</code>) from the <code>best(highest) 120 credits module</code> from the following marks and credits (the credits corresponds to the module): <pre><code>module[12]={48, 77, 46, 82, 85, 43, 49, 73, 65, 48, 47, 51} credits[12]={60, 20, 20, 20, 10, 20, 10, 10, 10, 20, 20, 10} </code></pre> What I have done is bubble sort the array, so that the array is sorted by decreasing manner to know which marks is higher, as shown below: <pre><code>module[12]={85, 82, 77, 73, 65, 51, 49, 48, 48, 47, 46, 43} credits[12]={10, 20, 20, 10, 10, 10, 10, 60, 20, 20, 20, 20} </code></pre> And then I need to choose the best 120 credits module from the sorted array so that the weighted average will be maximum, but then I have no idea where to start. =( Someone help me! Thanks a lot! EDIT: I have tried to work out the code myself, and eventually get the following code, it works, but for some special case it stop working =( <pre><code>float credits=0, result=0; n=0; struct{ float credits; float result; float n; float addpoint; }point; while (credits < 120){ credits+=credits[n]; result+=(result[n]*credits[n]); n++; } if (credits != 120){ credits -= credits[n-1]; result -= (result[n-1]*credits[n-1]); point.credits = credits; point.result = result; point.n = (n-1)-1; point.addpoint = n; again: while (credits < 120){ credits+=credits[n]; result+=(result[n]*credits[n]); n++; } if (credits != 120){ point.credits -= credits[point.n-1]; point.result -= result[point.n-1]*credits[point.n-1]; point.n--; credits = point.credits; result = point.result; n = point.addpoint-1; goto again; } } </code></pre> EDIT: Solved. Using knapsack problem code/integer linear programming by the application of glpk
Tags
<c><arrays><algorithm><sorting>
Title
How to choose the best marks with specified credits in c programming?
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USVoyage_Mystere
UserOwnerUserId
1. USVoyage_Mystere
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POHow to choose the best marks with specified credits in c programming?
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.