<< Chapter < Page Chapter >> Page >
int a[100];int i, n; int max;printf("\n Enter the size of the array: "); scanf("%d",&n); // Read the number of elements of the arrayfor(i = 0; i<n; i++) {printf("\n a[%d] = ",i);scanf("%d",&a[i]);} // Find the maximum elementmax = a[0]; // max is initialized by a[0]// compare max to other elements for(i = 1; i<n; i++) if(max<a[i]) //meet an element greater than maxmax = a[i]; // replace max by the new value from the elements.printf("\n The maximum element of the array is: %d", max);


The simplest type of searching process is the sequential search. In the sequential search, each element of the array is compared to the key, in the order it appears in the array, until the first element matching the key is found. If you are looking for an element that is near the front of the array, the sequential search will find it quickly. The more data that must be searched, the longer it will take to find the data that matches the key using this process.

here is the sample session with the above program

#include<stdio.h>#include<conio.h>void main() {int m[100], idx[100]; int n; // n is the actual size of the arrayint i, k, test; clrscr(); // clear screen// Read array m // Read the actual size of mprintf(“ Enter the number of elements scanf(“%d”,&n); // Read array’s elementsfor(i = 0;i<n;i++) {int temp; printf(“\n Enter the value of m[%d]= “,i); scanf(“%d”,&temp); m[i]= temp; }// Read the searching key k printf(“\n Enter the value you want to search : “);scanf(“%d”,&k); // Begin searchingtest = 0; // Scan all the elementsfor(i = 0;i<n;i++) if(m[i]= = k)//Compare the current element with the //searching key k{ // save the index of the current element idx[test]= i; test ++;} // Conclusionif(test>0) {printf(“\n there are %d elements which has the value of %d”,test,k); printf(“\n Indexes of those elements: “);for(i = 0;i<test;i++) printf(“%3d”,idx[i]); }else printf(“\n No element has the value %d”,k);getch(); // Wait until the user press any key }


Selection sort is a sorting algorithm, specifically an in-place comparison sort. Selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations. It works as follows:

  • Find the minimum value in the list
  • Swap it with the value in the first position
  • Repeat the steps above for remainder of the list (starting at the second position)

Effectively, we divide the list into two parts: the sublist of items already sorted, which we build up from left to right and is found at the beginning, and the sublist of items remaining to be sorted, occupying the remainder of the array.

Here is an example of this sort algorithm sorting five elements:

31 25 12 22 11 11 25 12 22 3111 12 25 22 31 11 12 22 25 31 #include<stdio.h>#include<conio.h>void main() {int m[100];//100 is the maximum size for array mint n; // n is the number of elements int i, j, k; clrscr(); // clear screen// Read the elements of array m // Read the actual size of the arrayprintf(“ Enter the number of elements: “); scanf(“%d”,&n); // Read array elementsfor(i = 0;i<n;i++) {int temp; printf(“\n Enter the value of m[%d]= “,i); scanf(“%d”,&temp); m[i]= temp; }// Print the array printf(“\n The array before sorting: “);for(i=0;i<n;i++) printf(“%3d”,m[i]); // Begin to sortfor(i = 0; i<n-1;i++) {// Put the minimum value in the list of n-i elements //to the ith positionfor(j = i+1;j<n;j++) {// compare m[i] with other element of the sublist// and swap m[i] and m[j]if m[j]<m[i].if(m[j]<m[i]){ int temp;temp = m[j]; m[j]= m[i]; m[i]= temp; }} // Print the array after the i+1 th step of sorting processprintf(“\n The array after step %d”,i+1); for(k = 0;k<n ;k++) printf(“%3d”,m[k]); }getch(); // Wait until the user press any key. }

Questions & Answers

find the 15th term of the geometric sequince whose first is 18 and last term of 387
Jerwin Reply
The given of f(x=x-2. then what is the value of this f(3) 5f(x+1)
virgelyn Reply
hmm well what is the answer
how do they get the third part x = (32)5/4
kinnecy Reply
can someone help me with some logarithmic and exponential equations.
Jeffrey Reply
sure. what is your question?
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
I'm not sure why it wrote it the other way
I got X =-6
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
is it a question of log
Commplementary angles
Idrissa Reply
im all ears I need to learn
right! what he said ⤴⤴⤴
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
Kevin Reply
a perfect square v²+2v+_
Dearan Reply
kkk nice
Abdirahman Reply
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
Kim Reply
or infinite solutions?
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Embra Reply
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
Nancy Reply
rolling four fair dice and getting an even number an all four dice
ramon Reply
Kristine 2*2*2=8
Bridget Reply
Differences Between Laspeyres and Paasche Indices
Emedobi Reply
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
Mary Reply
how do you translate this in Algebraic Expressions
linda Reply
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
Crystal Reply
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
Chris Reply
what's the easiest and fastest way to the synthesize AgNP?
Damian Reply
types of nano material
abeetha Reply
I start with an easy one. carbon nanotubes woven into a long filament like a string
many many of nanotubes
what is the k.e before it land
what is the function of carbon nanotubes?
I'm interested in nanotube
what is nanomaterials​ and their applications of sensors.
Ramkumar Reply
what is nano technology
Sravani Reply
what is system testing?
preparation of nanomaterial
Victor Reply
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
Himanshu Reply
good afternoon madam
what is system testing
what is the application of nanotechnology?
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
anybody can imagine what will be happen after 100 years from now in nano tech world
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
silver nanoparticles could handle the job?
not now but maybe in future only AgNP maybe any other nanomaterials
I'm interested in Nanotube
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
can nanotechnology change the direction of the face of the world
Prasenjit Reply
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
Ali Reply
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
bamidele Reply
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Got questions? Join the online conversation and get instant answers!
QuizOver.com Reply

Get the best Algebra and trigonometry course in your pocket!

Source:  OpenStax, Introduction to computer science. OpenStax CNX. Jul 29, 2009 Download for free at http://cnx.org/content/col10776/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Introduction to computer science' conversation and receive update notifications?