\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={An Optimized Input Sorting Algorithm},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2016 2016-01-15 (revised: 14 Year 2016 15 January 2016)}
\def\TheID{\makeatother }
\def\TheDate{2016 2016-01-15}
\title{An Optimized Input Sorting Algorithm}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Anshu  Mishra}

             \author[2]{Garima  Goyal}

             \affil[1]{  Jyothy Institute of Technology/ Visvervaraya Technological University}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 December 2015 Accepted: 3 January 2016 Published: 15 January 2016}

\maketitle


\begin{abstract}
        


One of the fundamental issues in compute science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research, because efficient sorting is important to optimize the use of other algorithms. Sorting involves rearranging information into either ascending or descending order. This paper presents a new sorting algorithm called Input Sort. This new algorithm is analyzed, implemented, tested and compared and results were promising.

\end{abstract}


\keywords{algorithm, sorting, input sort, insert.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
nformation growth rapidly in our world and to search for this information, it should be ordered in some sensible order. Many years ago, it was estimated that more than half the time on many commercial computers was spent in sorting. Fortunately this is no longer true organizing data, methods which do not require that the data be kept in any special order \hyperref[b0]{[1]}.\par
Many algorithms are very well known for sorting the unordered lists. Most important of them are Bubble, Heap, Merge, Selection \hyperref[b1]{[2]}. As stated in \hyperref[b2]{[3]}, sorting has been considered as a fundamental problem in the study of algorithms, that due to many reasons: 1. The need to sort information is inherent in many applications. 2. Algorithms often use sorting as a key subroutine. 3. In algorithms design there are many essential techniques represented in the body of sorting algorithms. 4. Many engineering issues come to the fore when implementing sorting algorithms. Efficient sorting algorithms is important to optimize the use of other algorithms that require sorted lists to work correctly; it is also often in producing human readable output. Formally, the output should satisfy two major conditions: 1. The output is in non-decreasing order. 2. The output is a permutation or reordering of the input. Since the early beginning of computing, the sorting problem has attracted many researchers, perhaps due to the complexity of solving it efficiently. Bubble sort was analyzed as early as 1956 \hyperref[b5]{[6]}.\par
Author ? ? : Assistant Professor, Department of Information Science \& Engineering Jyothy Institute of Technology, Bangalore. e-mails: anshu.garg13@gmail.com, goyal.garima18@gmail.com introductory computer science classes, where the abundance of algorithm for the problem provides a gentle introduction of core algorithm concepts \hyperref[b3]{[4,}\hyperref[b4]{5]}. In \hyperref[b3]{[4]}, they classified sorting algorithms by: 1. Computational complexity  {\ref (}  
\section[{Input Sort a) Concept}]{Input Sort a) Concept}\par
A simple sorting algorithm which sort the data whenever it is input from any input source e.g. keyboard or data from a stream of file. when new item comes then it is inserted at its specific position through a recursive function if there are n elements then n items 1 at a time is inserted in array which increase array size automatically and take its appropriate position.  
\section[{GET\textunderscore INPUT( ) for}]{GET\textunderscore INPUT( ) for}i = 1 to n \{ scan(c[i]) call INPUT\textunderscore SORT(c[i],1,size+1) \} end III. 
\section[{Working}]{Working} 
\section[{Suppose we have array c[1?5] of five elements as follows:}]{Suppose we have array c[1?5] of five elements as follows:}\par
First we call GET\textunderscore INPUT() function and read input from input source Which is Sorted Array .\par
IV. 
\section[{Complexity}]{Complexity}\par
Generally the complexity of an algorithm is measured in two phases. When one measures the complexity of an algorithm by pen and paper, he/she can only predict the complexity which give an idea how much time and space this algorithm takes to finish in its execution. This phase is called priory analysis. After implementing the algorithm in computer, we get the actual time and space. This phase of analyzing the algorithm is called the posterior analysis. complexity of an algorithm can be of two types: 1. Time Complexity: The analysis of algorithm for the prediction of computation time for execution of each and every instruction in the algorithm is called the time complexity. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
Some\\
sorting algorithms are "in-place", such that only\\
O(1)or O(log n)memory is needed beyond the items\\
being stored, while others need to create auxiliary\\
locations for data to temporally stored.\\
3. Recursion some algorithms are either recursive or\\
non recursive, while others may be both (e.g merge\\
sort).\\
4. Whether or not they are a comparison sort. A\\
comparison sort examines the data only by\\
comparing two elements with a comparison\\
operator.\\
This paper presents a new sorting algorithm\\
called input sort. Its typical use is when sorting the\\
elements of a stream from file.\\
II.\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.6716783216783216\textwidth}P{0.050524475524475525\textwidth}P{0.008916083916083917\textwidth}P{0.06538461538461539\textwidth}P{0.02972027972027972\textwidth}P{0.023776223776223775\textwidth}}
\multicolumn{4}{l}{An Optimized Input Sorting Algorithm}\tabcellsep \\
Year 2016\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
12\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Volume XVI Issue I Version I\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
( )\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Global Journal of Computer Science and Technology\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{Using}\tabcellsep the\tabcellsep standard\tabcellsep recurrence\tabcellsep equation\\
\multicolumn{5}{l}{T(n)=aT[n/b]+f(n) get this equation:}\\
\multicolumn{3}{l}{T(n)=2T[n/2]+n}\tabcellsep \multicolumn{2}{l}{a=2 b=2 f(n)=n}\\
n log a\tabcellsep \multicolumn{2}{l}{log 2 b = n 2 = n}\tabcellsep \tabcellsep \\
\multicolumn{5}{l}{using master method's 2 nd case apply}\end{longtable} \par
  {\small\itshape [Note: HSortingBest Case]} 
\caption{\label{tab_2}}\end{figure}
 			\footnote{© 2016 Global Journals Inc. (US)} 		 		\backmatter  			 \par
if f(n)=? (n log a b), then T(n)= ? (n log a b . log n) Time complexity of Input Sort is T(n)= ? ( n logn) 
\subsection[{VI. comparison with heap and merge sort}]{VI. comparison with heap and merge sort}\par
Now if we talk about heap merge sort than our algorithm is better from two in the sense that In merge sort we need two extra temporary array which increase its space complexity but no need of extra memory in our algorithm. our algorithm has order of O(nlog n) but it execute fast because of less comparisons than Merge heap and Quick sort. 
\subsection[{VII.}]{VII.} 
\subsection[{Conclusion}]{Conclusion}\par
In this paper new sorting algorithm is presented INPUT-SORT has O(nlog n) complexity but it is faster than existing sort mentioned in section 4 in detail. INPUT-SORT is definitely faster than other sort to sort n elements. Furthermore, the proposed algorithms are compared with some recent sorting algorithms; selection sort and bubble sort, heap, merge, insertion, quick sort. These algorithm can be applied on a real world application. any sorting algorithm might be a subroutine of another algorithms which affects its complexity.			 			  				\begin{bibitemlist}{1}
\bibitem[Astrachanm ()]{b5}\label{b5} 	 		\textit{Bubble Sort: An Archaeological Algorithmic Analysis},  		 			O Astrachanm 		.  		2003.  		 			Duk University 		 	 
\bibitem[Shahzad and Afzal ()]{b1}\label{b1} 	 		‘Enhanched Shell Sorting Algorithm’.  		 			B Shahzad 		,  		 			M Afzal 		.  	 	 		\textit{computer general of Enformatika}  		2007. 21  (6)  p. .  	 
\bibitem[Cormen et al. ()]{b2}\label{b2} 	 		\textit{Introduction to Algorithms},  		 			T Cormen 		,  		 			C Leisersion 		,  		 			R Rivest 		,  		 			C Stein 		.  		2001. McGraw Hill.  	 
\bibitem[Thoroup ()]{b4}\label{b4} 	 		‘Randomized Sorting in O(n log log n) Time And Linear Space Addition, Shift, and Bit Wise Boolean Operations’.  		 			M Thoroup 		.  	 	 		\textit{Computer Journal of Algo rithms}  		2002. 42  (2)  p. .  	 
\bibitem[Knuth ()]{b0}\label{b0} 	 		\textit{The Art Of Computer Programming},  		 			D Knuth 		.  		1998. Addison Wesley.  	 
\bibitem[Aho and Hopcroft ()]{b3}\label{b3} 	 		\textit{the design and analysis of computer Algorithms},  		 			A Aho 		,  		 			J Hopcroft 		,  		 			UllmanJ 		.  		1974. Addison Wesley.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
