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 VB code segment will count a number of characters of a given string,length of the string,change that string into upper case, and then reverse the string  

Asked in Computers & Technology at 2:59 PM on June 14, 2008

Tags: write, code, segment, count, number, characters, string, upper, reverse

! 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:59 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:53 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 8:17 PM on July 08, 2008

Report Abuse |  Rate this : 00
Yash
Yash
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 Raksha , an ibibo Master, at 3:03 PM on June 22, 2008

Report Abuse |  Rate this : 00
Raksha
Raksha
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 Romi , an ibibo Master, at 9:07 PM on June 21, 2008

Report Abuse |  Rate this : 00
Romi
Romi
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:07 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:41 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:40 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 Shobhit , an ibibo Master, at 6:19 PM on June 17, 2008

Report Abuse |  Rate this : 00
Shobhit
Shobhit
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 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

 

How to fix a general protection fault.

: Segment limits exceeded o with CS, DS, ES, FS, or GS, o accessing descriptor tables such as the GDT/IDT/LDT, Segment permissions violated o jumping to nonexecutable segments o writing to code or read only on switch pointing to a TSS descriptor in the LDT Miscellaneous o attempting to access an interrupt/exception handler from v86 mode when the handlers code segment DPL is greater than 0. o attempting to write

Posted in Computers & Technology by Anju at 11:13 AM on November 01, 2007
Tags general, protection
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