Odd errors (sorry for the bad title)

[radikll]

Hi, It's me again. I'm making a program for my C++ class (it's late already), and I'm getting some error I don't understand. It looks like a lot of code, but 1/2 of it is comments.

Here's the errors:

ass8.cpp: In function ‘int main()’:
ass8.cpp:158: error: expected primary-expression before ‘]’ token
ass8.cpp:160: error: duplicate case value
ass8.cpp:157: error: previously used here
ass8.cpp:161: error: expected primary-expression before ‘]’ token
ass8.cpp:163: error: duplicate case value
ass8.cpp:157: error: previously used here
ass8.cpp:164: error: expected primary-expression before ‘]’ token
ass8.cpp: At global scope:
ass8.cpp:173: error: expected unqualified-id before ‘{’ token
ass8.cpp:182: error: expected unqualified-id before ‘{’ token
ass8.cpp:187: error: expected unqualified-id before ‘{’ token

Here's the code:

/* My name */

/*
Based off of...

*******************************
Bubble sort

void bubbleSort()
{   
    // bubbles each element forward by comparing it to it's neighbor
    // loops until finished
    
    int temp;
    int toSort[10] = {10,9,8,7,6,5,4,3,2,1};
    
    for (int y=0; y < 10; y++)
    {
        for(int x=0; x < 10; x++)
        {
                if (toSort[x] > toSort[x+1])
                {
                              temp = toSort[x];
                              toSort[x] = toSort[x+1];
                              toSort[x+1] = temp;
                }
                cout << toSort[x] << " ";
        }
        cout << endl;
    }
    
}

Pseudocode is confusing!!

*******************************

*******************************
Selection sort

void selectionSort(int[] a) {
    for (int i = 0; i < a.length; i++) {
        int s = i;
        for (int j = i + 1; j < a.length; j++) {
            if (a[j] < a[s]) {
                s = j;
            }
        }
        int t = a[i];
        a[i] = a[s];
        a[s] = t;
    }
}
*******************************

*******************************
Insertion sort

insertionSort(array A)
begin
    for i := 1 to length[A]-1 do
    begin
        value := A[i];
        j := i-1;
        while j = 0 and A[j] > value do
        begin
            A[j + 1] := A[j];
            j := j-1;
        end;
        A[j+1] := value;
    end;
end;
*******************************

*******************************
mode of array by Manjiri

#include<stdio.h>

int main()
{
int i,j,k=1,p,a[20],b[20],n,cnt=1,big;
printf("Enter the maximum number of elements\n");
scanf("%d",&n);
printf("Enter the elements\n");
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
for(i=1; i<=n; i++)
{
for(j=i+1;j<=n; j++)
{
if(a[i]==a[j])
cnt++;
}
b[k]=cnt;
k++;
cnt=1;
}

big=b[1];
p=1;
for(i=2; i<=n; i++)
{
if(big<b[i])
{
big=b[i];
p=i;
}
}
printf("The element that occurs offenly is %d\n",a[p]);
printf("And it has occurred %d times\n",b[p]);
return 0;
} 
*******************************

			From Wikipedia
*	Your notes
*	http://en.wikipedia.org/wiki/Selection_sort
*	http://en.wikipedia.org/wiki/Insertion_sort
*	http://bytes.com/topic/c/answers/569655-how-find-mode-array
*/

#include <iostream>
#include <math.h>

using namespace std;

void mean(int [], int);
void median(int [], int);
void mode(int [], int);
void range(int [], int);
void stdDev(int [], int, int);

void bubble(int [], int);
void select(int [], int);
void insert(int [], int);

int main()
{
int howMany;
int counter=0;
char pickLett;
cout << "How many number do you want to input? ";
cin >> howMany;
int* Nums = new int[howMany];	// a pointer (i hope it works)
for(counter < howMany; counter++;)		// my 1st for loop :D It's soo easy
	Nums[counter] = (rand() % 100);

cout << "Do you want to use... \n";
cout << "(B)ubble sort\n";
cout << "(S)election sort\n";
cout << "(I)nsertion sort\n";
cout << "pick ";
cin >> pickLett;
switch(pickLett)
{
	case 'b'||'B':
		bubble(Nums[], howMany);
		break;
	case 's'||'S':
		select(Nums[], howMany);
		break;
	case 'i'||'I':
		insert(Nums[], howMany);
		break;
	default:
		cout << "b or s or i\n";
		break;
}
}

void mean(int Nums[], int howMany);
{
int daMean;
for ( int i = 0; i < howMany; i++ )
daMean += Nums[ i ];
cout << "The mean is " << daMean << "\n";
stdDev(Nums[], howMany, daMean);
}

void median(int Nums[], int howMany);
{
cout << int(Nums[howMany/2]);
}

void mode(int Nums[], int howMany);
{
	int count=1, b[20], big, p;
	for(int i=0;i<=howMany;i++;)
	{
		for(j=i+1; j<=howMany;j++)
		{
			if(Nums[i]==Nums[j])
				count++;
		}
		b[k]=count;
		k++;
		count=1;
	}
	big=b[1];	// I wish Manjiri left comments or used more meaningful names
	p=1;
	for(int i=2;i<=howMany;i++;)
	{
		if(big<b[i])
		{
			big=b[i];
			p=1;
		}
	}
	cout << Nums[p] << " occured " << b[p] << " more than all the other numbers";
}

void range(int Nums[], int howMany);
{
cout << (Nums[0] - Nums[howMany-1]);
}

void stdDev(int Nums[], int howMany, int daMean);
{
//int* deviat = new int[howMany];
int daMeanDeviat
for(int i=0; i<howMany; i++) {
	daMeanDeviat += (pow(Nums[i] - daMean),2);
}
cout << "The standard deviationis " << sqrt(daMeanDeviat);
}

/*Sorters below*/

void bubble(int Nums[], int howMany)
{
for(int i=0; i< howMany; i++;) {
	for(int j=0; j < howMany; j++;) {
		if(Nums[j] > Nums[j+1])
		{
		int tmp = Nums[j];
		Nums[j] = Nums[j+1];
		Nums[j+1] = tmp;
		}
	}
}
mean(Nums[], howMany);
median(Nums[], howMany);
mode(Nums[], howMany);
range(Nums[], howMany);
}

void select(int Nums[], int howMany)
{
for(int i=0; i<howMany; i++) {
        int s = i;
        for (int j = i + 1; j < howMany; j++) {
            if (Nums[j] < Nums[s]) {
                s = j;
            }
        }
        int t = Nums[i];
        Nums[i] = Nums[s];
        Nums[s] = t;
}
mean(Nums[], howMany);
median(Nums[], howMany);
mode(Nums[], howMany);
range(Nums[], howMany);
}

void insert(int Nums[], int howMany)
{
for(int i=1; i<howMany; i++;) {
	int tmp = Nums[i];
	int j = i - 1;
	while((j=0)&&(Nums[j]>tmp)) {
		Nums[j+1] = Nums[j];
		j = j - 1;
		Nums[j+1] = tmp
	}
}
mean(Nums[], howMany);
median(Nums[], howMany);
mode(Nums[], howMany);
range(Nums[], howMany);
}

[Gumbercules]

one for loop is missing the initializer and has an extra semicolon, many have an extra semicolon at the end. write it like this if you want nothing for initalizer
for( ; counter < howMany; counter++)
when you pass an array (well, actually just a pointer) to a function, you just use the name, no [] after.
in some functions implementation you have a semicolon before the block.
you don't use || for cases, write it like:

	case 'b':
        case 'B':
		bubble(Nums, howMany);
		break;

you never declare k.
problem with the parentheses used with pow