putera_ranggi 0 Report post Posted August 14, 2004 aku ado prob nilec aku suruh aku buat satu aturcaradia bagi 7 input nomborsebagai contoha = 10b = 69c = 45d = 98e = 54f = 39g = 20lepas tu kena cari hasil tambah tak termasuk yang paling tinggi dan yang paling rendahjadi prob aku nyercamner aku nak setelkan prob tu Quote Share this post Link to post Share on other sites
encik pot pet 0 Report post Posted August 14, 2004 compare semua nombor.. one by one.. lepas tu ko akan dapat sort nombor2 tu dari kecik hingga paling besarlepas tu add semua no kecuali kecik dan besar..hints:guna array and temporary variable Quote Share this post Link to post Share on other sites
akuBest 0 Report post Posted August 16, 2004 A'kum. betul tu... kalo nak lagik best, guna pointer..... Quote Share this post Link to post Share on other sites
raihan 0 Report post Posted August 16, 2004 (edited) guna stack based array je. int rawnum[7];pastu baca camner nak guna bubble-sort sana(memerlukan 2 gelung for).pastu lagi sekali gelung for utk totalkan sumer nombor dlm array[7] taktermasuk yg ~paling besar[6] dgn yg ~terkecik[0], miahaha Edited August 16, 2004 by raihan Quote Share this post Link to post Share on other sites