<< 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

do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
Damian Reply
absolutely yes
how to know photocatalytic properties of tio2 nanoparticles...what to do now
Akash Reply
it is a goid question and i want to know the answer as well
characteristics of micro business
Do somebody tell me a best nano engineering book for beginners?
s. Reply
what is fullerene does it is used to make bukky balls
Devang Reply
are you nano engineer ?
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
what is the actual application of fullerenes nowadays?
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
what is the Synthesis, properties,and applications of carbon nano chemistry
Abhijith Reply
Mostly, they use nano carbon for electronics and for materials to be strengthened.
is Bucky paper clear?
so some one know about replacing silicon atom with phosphorous in semiconductors device?
s. Reply
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Do you know which machine is used to that process?
how to fabricate graphene ink ?
for screen printed electrodes ?
What is lattice structure?
s. Reply
of graphene you mean?
or in general
in general
Graphene has a hexagonal structure
On having this app for quite a bit time, Haven't realised there's a chat room in it.
what is biological synthesis of nanoparticles
Sanket 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
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
Berger describes sociologists as concerned with
Mueller Reply
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?