Hello everybody. Now i want to share program C + + about sort score the student in school (Project 1). In this section you must know the search engine. What is seacrh enhgine?
A
search engine is Associate in Nursing info retrieval system designed to assist realize info hold on a computing system. The search results square measure typically bestowed in a very list
and square measure unremarkably referred to as hits.
Search engines facilitate to reduce the time needed to search out info and therefore the quantity of
data that should be
consulted, resembling different techniques
for managing info overload.[citation needed]
The most public, visible type of an
enquiry engine may be a net computer program that searches for info on the planet Wide net.
How search engines work
Search engines offer Associate in Nursing interface
to a bunch things|of things} that allows users
to specify criteria regarding Associate in Nursing item
of interest and have the engine realize the
matching items. the standards square measure named as an enquiry question. within the case of text search engines, the
search question is usually expressed
as a collection of words that establish the
required concept that one or additional documents could contain.
There square measure many sorts of search question syntax that modify in strictness. It also can switch names inside the search engines from previous sites. Whereas
some text search engines need users to enter 2or 3 words separated by white house, different search engines could alter users
to specify entire documents, pictures, sounds, and numerous kinds
of linguistic
communication. Some search
engines apply enhancements to go looking queries to extend the probability of
providing a top quality set of things through a method referred to as question growth.
The list of things that
meet the standards specified by the question is usually sorted,
or ranked. Ranking things by
connexion (from
highest to lowest) reduces the time needed to search out the required info. Probabilistic search engines rank things supported measures
of similarity (between every item and therefore the question, generally on a scale of one to zero, one being most similar) and generally quality or
authority (see Bibliometrics) or use connexion feedback. mathematician search
engines generally solely come back things that match precisely while
notrelevance order, though the
term mathematician computer program could merely ask the utilization of boolean-style syntax (the use of
operators AND, OR, NOT, and XOR) in a very probabilistic
context.
To
provide a collection of
matching things that square measure sorted consistent with some criteria quickly, an enquiry engine can generally collectmetadata regarding the cluster of things into consideration beforehand
through a method named as compartmentalization. The
index generally needs a
smaller quantity of memory board, that is why some search engines solely store the indexed info and not the complete content of every item, and instead offer a way of navigating to the things within the computer program result
page. instead, the computer program could store a replica of
every item in a very cache in order that users will see the state of the item at the time it had been indexed or for archive functions or to form repetitive
processes work additional with efficiency and
quickly.
Other varieties of search
engines don't store Associate in Nursing index. Crawler, or spider kind search engines (a.k.a. time period search engines) could collect and assess things at the time of the search question, dynamically
considering further things supported the
contents of a beginning item
(known as a seed, or seed URL within the case of a web crawler). Meta search engines store neither Associate in Nursing index nor a cache Associate in Nursingd instead merely employ the
index or results of 1 or additional different search
engines to produce an
collective, final set of results.
In my opinion :
Every computer program uses totally different advanced mathematical
formulas to get search
results. The results for a particular question square measure then
displayed on the SERP. computer program algorithms take the key components of an internet page, as well as the page title, content and keyword
density, and are available up
with a ranking for wherever to put the
results on the pages. every search
engine’s rule is exclusive, thus a prime ranking
on Yahoo! doesn't guarantee
a outstanding ranking on Google, and contrariwise. to form things additional difficult, the algorithms utilized by search
engines aren't solely closely
guarded secrets, they're conjointly perpetually undergoing
modification and revision. this suggests that the standards to best optimize a web site with should be
surmised through observation, similarly as
trial and error — and not just the once, however incessantly.
Gimmicks
less honored SEO corporations tout because the answer to higher web
site rankings may match at the best for less than a brief amount before
the search engine’s developers become wise the techniques and alter their
rule. additional doubtless, sites mistreatment these
tricks are going to be labelled as
spam by the search engines and their rankings can plummet.
Search engines solely “see”
the text on websites, and use the underlying markup language structure to see connexion. massive photos, or dynamic Flash animation mean nothing to go looking engines, however the
particular text on your pages will. it's troublesome to create a
Flash web site that's as
friendly to go looking engines;
as a result, Flash sites can tend to not rank as high as sites developed with well coded markup language and CSS (Cascading vogue Sheets — a fancy mechanism
for adding designs to web site pages higher than and on the far side regular HTML). If the terms you would like to be found by don't seem within the text
of your web site, it'll beterribly troublesome for
your web site to
yield high placement within the SERPs.
And if you understand about search
engine, now this is the code :
#include<iostream>
#include<string.h>
#include
<stdlib.h>
using
namespace std;
int main()
{
struct
DataMhs
{
string nim;
char Name[50];
int exam, lastexam, prac, na;
};
int
menu, result, i, j, TheStudents;
DataMhs
student[50];
DataMhs
temp;
cout<<"Sorting"<<endl;
cout<<"How many student : "; cin>>TheStudents;
for(int a=0;
a<TheStudents; a++)
{
cout<<"Nim : "; cin>>student[a].nim;
cout<<"Name : "; cin>>student[a].Name;
cout<<"Exam : "; cin>>student[a].exam;
cout<<"Last Exam : "; cin>>student[a].lastexam;
cout<<"Practice : "; cin>>student[a].prac;
result = (0.25 * student[a].exam) + (0.5 * student[a].lastexam) +(0.25 *
student[a].prac);
student[a].na=result;
cout<<endl;
}
system("cls");
cout<<"The Data is not sorting "<<endl;
for(int
b=0; b<TheStudents; b++)
{
cout<<"Nim : "<<student[b].nim<<endl
<<"Name :
"<<student[b].Name<<endl
<<"Exam :
"<<student[b].exam<<endl
<<"Last
exam : "<<student[b].lastexam<<endl
<<"Practice :
"<<student[b].prac<<endl
<<"Total :
"<<student[b].na<<endl<<endl;
}
cout<<endl<<"Choose the sorting : "<<endl
<<"[1] SOrt by NIM"<<endl
<<"[2] Sort by Last Exam"<<endl
<<"Please choose u want "; cin>>menu;
system("cls");
if(menu==1)
{
for(i=0; i<TheStudents-1; i++)
{
for(j=0; j<TheStudents-1-i; j++)
{
if(student[j].nim>student[j+1].nim)
{
temp.nim=student[j].nim;
student[j].nim=student[j+1].nim;
student[j+1].nim=temp.nim;
strcpy(temp.Name, student[j].Name);
strcpy(student[j].Name, student[j+1].Name);
strcpy(student[j+1].Name, temp.Name);
temp.exam=student[j].exam;
student[j].exam=student[j+1].exam;
student[j+1].exam=temp.exam;
temp.lastexam=student[j].lastexam;
student[j].lastexam=student[j+1].lastexam;
student[j+1].lastexam=temp.lastexam;
temp.prac=student[j].prac;
student[j].prac=student[j+1].prac;
student[j+1].prac=temp.prac;
temp.na=student[j].na;
student[j].na=student[j+1].na;
student[j+1].na=temp.na;
}
}
}
cout<<"\nData is sorted"<<endl;
for(int c=0; c<TheStudents; c++)
{
cout<<"Nim : "<<student[c].nim<<endl
<<"Name :
"<<student[c].Name<<endl
<<"EXAM :
"<<student[c].exam<<endl
<<"LASTEXAM
: "<<student[c].lastexam<<endl
<<"Practice : "<<student[c].prac<<endl
<<"Total :
"<<student[c].na<<endl<<endl;
}
}else
if(menu==2)
{
for(i=0; i<TheStudents-1; i++)
{
for(j=0; j<TheStudents-1-i; j++)
{
if(student[j].na>student[j+1].na)
{
temp.nim=student[j].nim;
student[j].nim=student[j+1].nim;
student[j+1].nim=temp.nim;
strcpy(temp.Name,
student[j].Name);
strcpy(student[j].Name, student[j+1].Name);
strcpy(student[j+1].Name, temp.Name);
temp.exam=student[j].exam;
student[j].exam=student[j+1].exam;
student[j+1].exam=temp.exam;
temp.lastexam=student[j].lastexam;
student[j].lastexam=student[j+1].lastexam;
student[j+1].lastexam=temp.lastexam;
temp.prac=student[j].prac;
student[j].prac=student[j+1].prac;
student[j+1].prac=temp.prac;
temp.na=student[j].na;
student[j].na=student[j+1].na;
student[j+1].na=temp.na;
}
}
}
cout<<"\nData is sorted"<<endl;
for(int c=0; c<TheStudents; c++)
{
cout<<"Nim :"<<student[c].nim<<endl
<<"Name
:"<<student[c].Name<<endl
<<"EXAM
:"<<student[c].exam<<endl
<<"LASTEXAM
:"<<student[c].lastexam<<endl
<<"Practice
:"<<student[c].prac<<endl
<<"Total
:"<<student[c].na<<endl<<endl;
}
}else
{
cout<<"U choose the wrong choice, please try
again"<<endl;
}
cout<<"------------------------------------------"<<endl;
cout<<"\tCreated by (Panji Sadewo) Hsep 7"<<endl;
cout<<"\tI'am fron Indonesia"<<endl;
cout<<"\tI'am study in Amikom Yogyakarta"<<endl;
cout<<"\tIf u have a project"<<endl;
cout<<"\tU can send me a message"<<endl;
cout<<"\tmirorforce@gmail.com"<<endl;
cout<<"\tOr u can contact amikom.ac.id to find
me"<<endl;
cout<<"------------------------------------------"<<endl;
return
0;
}
The output :
Belum ada tanggapan untuk "Calculate Student C++"
Posting Komentar