Skip to main content

Total programming language in the world

we live in this time where every thing is computer so you should know all programming language.

but we all is use most of the c,c++,c#,java ,python,javascript,html,xml etc.


LIST OF ALL PROGRAMMING LANGUAGE-


BASIC


Eiffel


Forth


Frink


Game Maker Language


ICI


J


Lisp


Lua


M


Pascal


PCASTL


Perl


PostScript


Python


REXX


Ruby


S-Lang


Spin


Functional Programming Languages


Charity


Clean


Curry


Erlang


F#


Haskell


Joy


Kite


ML


Nemerle


OPAL

OPS5


Q


Compiled Programming Languages


Ada


ALGOL

C


C++


C#


CLEO


COBOL


Cobra


D


DASL


Fortran


Java


JOVIAL


Objective-C


SMALL


Smalltalk


Turing


Visual Basic


Visual FoxPro


XL


Procedural Programming Languages


Bliss


ChucK


CLIST


HyperTalk


Modula-2


Oberon


Component Pascal


MATLAB


Occam


PL/C


PL/I


Rapira


RPG


Scripting Languages


AppleScript


Awk


BeanShell


ColdFusion


F-Script


JASS


Maya Embedded Language


Mondrian


PHP


Revolution


Tcl

VBScript


Windows PowerShell


Markup Languages


Curl


SGML


HTML


XML


XHTML


Logic-based Programming Languages


ALF


Fril


Janus

Leda

Oz


Poplog


Prolog

.

ROOP


Concurrent Programming Languages


ABCL


Afnix


Cilk


Concurrent Pascal


E


Joule


Limbo


Pict


SALSA


SR


Object-Oriented Programming Languages


Agora


BETA


Cecil


Lava


Lisaac


MOO


Moto


Object-Z

Obliq


Oxygene


Pliant


Prograph


REBOL


Scala



Slate


XOTcl


IO


Comments

Popular posts from this blog

solution of TRICOUNT - Counting Triangles on spoj

  TRICOUNT - Counting Triangles solution- #include<stdio.h> int main() {     int t;     scanf("%d",&t);     while(t--)     {         long long unsigned num,sum;         scanf("%llu",&num);         if(num%2==0)         sum=(num*(num+2)*((2*num)+1))/8;         else         sum=((num*(num+2)*((2*num)+1))-1)/8;         printf("%llu\n",sum);     }     return 0; }

solution of PRIME1 - Prime Generator on spoj

PRIME1 - Prime Generator solution- #include<stdio.h> #include<math.h> int main() {int t; long long int l,h,i,flag; scanf("%d",&t); while(t--) { scanf("%lld%lld",&l,&h); while(l<=h) { flag=0; for(i=2;i<=sqrt(l);i++) { if(l%i==0) { flag=1;     break; } } if(flag==0) { if(l!=1) printf("%lld\n",l); } l++; } printf("\n"); } return 0; }