I can find smallest numbers in array of integer but How to find second, third, fourth, fifth smallest number i?
Code:#include <stdio.h> int main() { char array[5] = {4, 5, 9, 1, 2}; int smallest = array[0]; int i= 1; for (i=1; i<5; i++) { if (smallest > array[i]) { smallest = array[i]; printf (" %d", smallest); } } return 0; }
You may find this problem easier to solve if you sort the array, although depending on your exactly requirements you don't necessarily have to sort the array, or at least not fully.
Look up a C++ Reference and learn How To Ask Questions The Smart WayOriginally Posted by Bjarne Stroustrup (2000-10-14)
How to do it without sorting array
find first smallest number in array
find second smallest number in array
find third smallest number in array
find fourth smallest number in array
find fifth smallest number in array
What are your exact requirements, i.e., can there be duplicate values in the array, and if so, what does "second smallest" mean if the smallest value appears twice?
Are you only interested in finding say, the second smallest value, or the third smallest, etc, and that's it? Or do you want to in fact find the smallest, and the second smallest, and the third smallest, etc? If it is the latter, then sort the array.
Look up a C++ Reference and learn How To Ask Questions The Smart Way
I know that you haven't answered in a few days and have probably moved on, but I think that laserlight's suggestion of a sorting algorithm will be the best way.
Even if you have finished your assignment, looking at sorting arrays now will make life easier for you later.
There are a few different types, some quicker than others...
I suggest that a good one to look at first is the bubble sort - Bubble sort - Wikipedia
Fact - Beethoven wrote his first symphony in C
