Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
C Program for MAXIMUM NO, MINIMUM NO AND SORTING
void main()
{
int i,j,t;
int a[5];
clrscr();
for(i=0;i<5;i++)
printf("ENTER THE SINGLE DIGIT= ");
flushall();
scanf("%d",&a[i]);
}
for(j=0;j<5;j++)
if(a[i]>a[j])
t=a[i];
a[i]=a[j];
a[j]=t;
printf("\n");
printf(" %d",a[j]);
printf("\nTHE MAXIMUM NUMBER IS %d\n",a[5]);
printf("THE MINIMUM NUMBER IS %d\n",a[0]);
getch();
OUTPUT :
ENTER THE SINGLE DIGIT : 5
ENTER THE SINGLE DIGIT : 8
ENTER THE SINGLE DIGIT : 1
ENTER THE SINGLE DIGIT : 2
ENTER THE SINGLE DIGIT : 6
8 6 5 2 1
THE MAX. NO IS : 8
THE MIN. NO IS : 1
please send code for inverted index file
padovan string program 1 : package test.padovanstring; public class PadovanString { public int stringOccurrences(int n, String str){ if(n >= 40) return -
Write a program to create a binary file and store the following data "hello", 0x0030,'1', 1.234 Using visual studio examine the binary file and note how the day is stored Answe
Implementing Operator Functions The general format of the Operator function is: return_type operator op ( argument list ); Where op is the symbol for the operator be
pseudo code
is getchar() is a C++ library function?
Requirements: 1. This assignment as well as other assignments in this class must be finished on Windows operating system. 2. Zip your program and submit the zip file on ANG
WHAT IS A C LANGUAGE? C IS A PROGRAMMING?
WAP TO PRINT NUMBERS FROM 1-50 WHICH ARE DIVIDED BY 7 void main () { int a; clrscr (); a=1; while (a { if (a%7==0) printf ("%d\n",a); a++; } ge
source code for padovan string
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd