Sign Up to our questions and Answers Engine to ask questions, answer people’s questions, and connect with other people. 👉Note: After Sign Up. A confirmation mail will be sent to your registered email account, If you have not received the confirmation mail, kindly Check Your Spam Mails.
Login to our Questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email. If not received mail yet, please check your spam mails.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Write an algorithm to find the minimum number in a given list of elements.
Step 1: start Step 2: Read n numbers and store them in a list. Step 3: set count =1 Step 4: min = list[count] Step 5: while(not end of the list) then goto step 6 otherwise goto step 8 Step 6: if(list[count]<min) min = list[count] count = count+1 Step 7: goto step 5 Step 8: if the complete list isRead more
Step 1: start
See lessStep 2: Read n numbers and store them in a list.
Step 3: set count =1
Step 4: min = list[count]
Step 5: while(not end of the list) then goto step 6 otherwise goto step 8
Step 6: if(list[count]<min)
min = list[count]
count = count+1
Step 7: goto step 5
Step 8: if the complete list is scanned then display the value present in the min variable as the minimum number in the list.