Where to get help on formularting the liner programing question?
141538
Read the references at the end of the article or talk to an industrial engineer.\n\nhttp://en.wikipedia.org/wiki/Linear_programming
564045
http://www.gaurang.org/programs/\n\nsearch for infix and postfix on this page
750340
Dont worry , I know the book that has done it for you.\nthat is :"Compilers: Principles, Techniques, and Tools. Alfred V.                    Aho, Ravi Sethi, Jeffrey D.Ullman"\nif you could not reach that book search its slides on the web or refer to Jeffry D.Ullman web site to get lecture notes at: http://infolab.stanford.edu/~ullman/\nit has a complet source code for a lexical analyzer for a sample grammar.\nat first step you must write a garmmar that has no left recortion\nand for any nonterminal write a function that calls other nonterminals or matches terminals.
264228
try:\nhttp://www.planet-source-code.com
156330
u can find them\nhttp://java.sun.com/docs/books/tutorial/index.html\ndownload the .zip files available\ni had downloaded and they are very encouraging for the programmers.
588997
I use "C++ How to Program" by Deitel & Deitel.\nIt's really good
725856
You might try Chisenbop.  See the following on-line references:\n\nhttp://www.cs.iupui.edu/~aharris/chis/chis.html\nhttp://en.wikipedia.org/wiki/Chisenbop
1068708
http://www.cprogramming.com/
136424
This will certainly help you\nhttp://www.codeguru.com/
250161
Most people probably arent going to want to do your homework for you, and doing it yourself is the best way to learn. Having said that, you can try a lookup on planetsourcecode and see if there is anything similar to what you need. You can search for different programming languages based on keyword.
1070095
use programing syntax
990832
try this dude www.planetsourcecode.com
842187
Write each problem on a separate line so it's more easily read
345647
http://www.phys.ufl.edu/docs/matlab/toolbox/comm/tutor3.html
402436
http://clpp.sourceforge.net/home.html
565485
can you go to javascritp.com get some directions?? Im having the same problem.
979933
I'm giving u the program (in C), just go through it, then write the algo. It'll be easier.\n\n// Program :  MERGE  SORT\n\n#include<stdio.h>\n#include<conio.h>\n\nvoid mergesort(int *,int);\n\nvoid main()\n{\nint x[30],n,i;\nclrscr();\nprintf("Enter total no. of elements");\nscanf("%d",&n);\nprintf("Enter %d nos.",n);\nfor(i=0;i<n;i++)\n   scanf("%d",&x[i]);\n\nmergesort(x,n);\n\nprintf("After sorting in descending order :&#92;n");\nfor(i=n-1;i>=0;i--)\n  printf(" %d",x[i]);\n\ngetch();\n}\n\n\n\nvoid mergesort(int x[],int n)\n{\n  int aux[30],l1,l2,u1,u2,i,j,k,size;\n  size=1;   // merges file of size 1\n  while(size<n)\n  {\n    l1=0;   // initialize lower-bound of 1st. file\n    k=0;    // k is index for auxilliary array\n    while(l1+size<n)\n    {\n      // initialize remaining parameters...\n      l2=l1+size;\n      u1=l2-1;\n      u2=(l2+size-1)<n ? (l2+size-1):(n-1);\n      for(i=l1,j=l2;i<=u1 && j<=u2;k++)\n if(x[i]<=x[j])\n   aux[k]=x[i++];\n else\n   aux[k]=x[j++];\n      while(i<=u1)\n      aux[k++]=x[i++];\n      while(j<=u2)\n      aux[k++]=x[j++];\n\n      l1=u2+1;\n    } /* end of 2nd. while-loop */\n    for(i=l1;k<n;i++)\n       aux[k++]=x[i];\n    for(i=0;i<n;i++)\n       x[i]=aux[i];\n\n    size*=2;\n  } /* end of 1st. while-loop */\n}