Question

pseudocode to find the armstrong number​

Answer 1

NANBA..

Pseudocode

PseudocodeWe can draft a pseudocode of the above algorithm as follows −

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE IF sum equals to number

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE IF sum equals to number PRINT armstrong

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE IF sum equals to number PRINT armstrong ELSE

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE IF sum equals to number PRINT armstrong ELSE PRINT not an armstrong

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE IF sum equals to number PRINT armstrong ELSE PRINT not an armstrong END IF

PseudocodeWe can draft a pseudocode of the above algorithm as follows −procedure armstrong : number check = number rem = 0 WHILE check IS NOT 0 rem ← check modulo 10 sum ← sum + (rem)3 divide check by 10 END WHILE IF sum equals to number PRINT armstrong ELSE PRINT not an armstrong END IFend procedure