#include <iostream>

using namespace std;

int main(int argc, char* argv[])
{
    for(int i = 0; i < argc; i++)
    {
	cout << "argv[" << i << "] == " << argv[i] << endl;
    }
    return 0;
}

#include <iostream>

using namespace std;

enum KNOWN_TYPES { INT = 1, FLOAT = 2 };

typedef struct UnknownType
{
    enum KNOWN_TYPES ktype;
    void* pdata;
} UNKNOWN;

void work(void* p)
{
    UNKNOWN* punk = (UNKNOWN*)p;
    switch(punk->ktype)
    {
	case INT:
	    cout << "The Integer value you entered was: " << (*(int*)punk->pdata) << endl;
	    break;
	case FLOAT:
	    cout << "The Float value you entered was: " << (*(float*)punk->pdata) << endl;
	    break;
	default:
	    break;
    }
}

int main()
{
    int v;
    float f;
    
    cout << "1 = Integer\n2 = Float\n\nPlease Enter Type to be entered: ";
    cin >> v;
    UNKNOWN unk;
    unk.ktype = (KNOWN_TYPES)v;
    switch(unk.ktype)
    {
	case INT:
	   cout << "\nOkay, please enter an Integer: ";
	    cin >> v;
	    unk.pdata = &v;
	    break;
	case FLOAT:
	    cout << "\nOkay, please enter a Float: ";
	    cin >> f;
	    unk.pdata = &f;
	    break;
	default:
	    break;
    } 
    work(&unk);
    return 0;
}

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#define MAX_STRING_SIZE    16
#define ELEMENTS           10

typedef struct {
  char *name;
  char *count;
} fruit;

fruit list[] = { { "apples", "3" }, { "bananas", "2" }, { "grapes", "10" }, { "oranges", "1" } ,
                 { "cherries", "9" }, { "dates", "7" }, { "plums", "8" }, { "pears", "4" },
                 { "cranberries", "6" }, { "figs", "5" } };

void output(fruit[], char*);
int ascending_alphabetic_by_name(const void*, const void*);
int descending_alphabetic_by_name(const void*, const void*);
int ascending_count_by_ascii(const void*, const void*);
int ascending_count_by_value(const void*, const void*);

int main()
{
  output(list, "initial order");

  qsort(list, ELEMENTS, sizeof(fruit), &ascending_alphabetic_by_name);
  output(list, "ascending alphabetic by name");

  qsort(list, ELEMENTS, sizeof(fruit), &descending_alphabetic_by_name);
  output(list, "descending alphabetic by name");

  qsort(list, ELEMENTS, sizeof(fruit), &ascending_count_by_ascii);
  output(list, "ascending count by ASCII");

  qsort(list, ELEMENTS, sizeof(fruit), &ascending_count_by_value);
  output(list, "ascending count by value");
 
  return 0;
}

void output(fruit a[], char *msg)
{
  int i;

  printf("%s\n", msg);

  for (i = 0; i < ELEMENTS; i++) {
    printf("%2d\t%-10s\t%2s\n", i, a[i].name, a[i].count);
  }
}

int ascending_alphabetic_by_name(const void *p, const void *q)
{
  return strcmp(((fruit*) p)->name, ((fruit*) q)->name); 
}

int descending_alphabetic_by_name(const void *p, const void *q)
{
  return strcmp(((fruit*) q)->name, ((fruit*) p)->name); 
}

int ascending_count_by_ascii(const void *p, const void *q)
{
  return strcmp(((fruit*) p)->count, ((fruit*) q)->count); 
}

int ascending_count_by_value(const void *p, const void *q)
{
  int a = atoi(((fruit*) p)->count);
  int b = atoi(((fruit*) q)->count);

  if (a > b)
    return 1;
  else if (a < b)
    return -1;
  else if (a == b)
    return 0;
}