There are n toffees and K students such that n
Fantastic news! We've Found the answer you've been seeking!
Question:
There are n toffees and K students such that n<=K. Each toffee has attributes: name, company,price, color and size. Each student also has attributes: name, roll no, class and section. The toffees are distributed randomly in an order such that 1st student gets 1 toffee, 2nd student gets 2, 3rd student gets 3 and so on till Kth student. Write a program in C using the concepts of pointers and structure that displays the details of the student having maximum and minimum number of toffees.
Related Book For
Introduction to Probability
ISBN: 978-0716771098
1st edition
Authors: Mark Daniel Ward, Ellen Gundlach
Posted Date: