Ask Questions & Get Answers at ibibo sawaal
Home Ask Question Answer Questions My Q&A CategoriesAsk the experts Expert leader board

Home » Computers & Internet » Computers & Technology » Question

 

.Write a program to sort a list of book’s name alphabetically  

Asked in Computers & Technology at 3:25 PM on June 14, 2008

Tags: program, sort, list, name, alphabetically

! This question is closed
Report abuse
Rakesh Singh
Rakesh Singh
Profile | Q&A

well, void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Ni .. , an ibibo Master, at 10:58 AM on July 13, 2008

Report Abuse |  Rate this : 00
Ni ..
Ni ..
Profile | Q&A

well, void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Satya ~ , an ibibo Master, at 4:51 PM on July 10, 2008

Report Abuse |  Rate this : 00
Satya ~
Satya ~
Profile | Q&A

void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Yash , an ibibo Master, at 9:44 AM on July 02, 2008

Report Abuse |  Rate this : 00
Yash
Yash
Profile | Q&A

well Rakesh, In C++

#include <iostream.h>
#include <stdlib.h>

const int MAXSIZE = 10;

void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Raksha , an ibibo Master, at 3:11 PM on June 22, 2008

Report Abuse |  Rate this : 00
Raksha
Raksha
Profile | Q&A

void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Madhurima , an ibibo Master, at 6:06 PM on June 19, 2008

Report Abuse |  Rate this : 00
Madhurima
Madhurima
Profile | Q&A

well, void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Uttam , an ibibo Master, at 8:36 PM on June 18, 2008

Report Abuse |  Rate this : 00
Uttam
Uttam
Profile | Q&A

void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Ashish Yadav , an ibibo Wizard, at 6:39 PM on June 18, 2008

Report Abuse |  Rate this : 00
Ashish Yadav
Ashish Yadav
Profile | Q&A

void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Gyan Singh , an ibibo Master, at 5:47 AM on June 18, 2008

Report Abuse |  Rate this : 00
Gyan Singh
Gyan Singh
Profile | Q&A

void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Sharad Singh , an ibibo Master, at 2:33 PM on June 17, 2008

Report Abuse |  Rate this : 00
Sharad Singh
Sharad Singh
Profile | Q&A

hi there

void selectionSort(int arr[], int size);
void swap(int& x, int& y);

int main()
{
int numbers[] = { 13, 5, 1, 7, 9, 11, 3, 17, 19, 15 };
int k;

cout << "BEFORE SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

selectionSort(numbers, MAXSIZE);

cout << endl << endl;
cout << "AFTER SORT: ";
for (k = 0; k < MAXSIZE; k++)
cout << numbers[k] << " ";

cout << endl << endl << endl;

system("PAUSE");
ret urn 0;
}// end main()

void selectionSort(int arr[], int size)
{
int indexOfMin, pass, j;

for (pass = 0; pass < size - 1; pass++)
{
indexOfMin = pass;

for (j = pass + 1; j < size; j++)
if (arr[j] < arr[indexOfMin])
indexOfMin = j;

swap(arr[pass], arr[indexOfMin]);
}
}// end selectionSort()

void swap(int& x, int& y)
{
int temp;
temp = x;
x = y;
y = temp;
}// end swap()

Answered by Reeta K , an ibibo Master, at 2:25 PM on June 17, 2008

Report Abuse |  Rate this : 00
Reeta K
Reeta K
Profile | Q&A

Related Search

 

I WAN TO WRITE A PROGRAM TO SORT A LINKLIST IN TURBOC?CAN YOU PLEASE TELL ME HOW TO DO IT

NodeRight;CNodeInteger RemoveNodeCNodeInteger oNode;;The 4 functions that we will need for our sorting are: InsertNode - traverses the list and inserts the node at the appropriate place; AddNode - adds a node to the headNodesCNodeInteger oNodeLeft, CNodeInteger oNodeRight;CNodeInteger RemoveNodeCNodeInteger oNode;;The 4 functions that we will need for our sorting are: InsertNode - traverses the list and inserts the node

Posted in Computers & Technology by Nick - at 6:08 PM on June 24, 2008
Tags write, program, sort, linklist, please, tell
More such questions »
Editor's Pick
Prev | Next

Ask a Question

160
   Ask now

Categories

View All
sawaal signature
sawaal free visiting card
All time Top Experts in Computers & Technology
121734 pts
45751 pts
36995 pts
35555 pts
32215 pts

View All