\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={Enhanced Novel 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Enhanced Novel 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]{  R.Srinivas}

             \affil[1]{  Surampalem}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2012 Accepted: 3 January 2013 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


In computer science and mathematics; we can formulate a procedure for sorting unordered array or a file. Such procedure is always governed by an algorithm; which is called as Sorting Algorithm. Sorting is generally understood to be the process of rearranging a given set of objects in a specific order. The purpose of sorting is to facilitate the later search for members of the sorted set.

\end{abstract}


\keywords{}

\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
he intelligent and most intuitive way to do this is to analyze the items in the array or list with each other and adapt them according to their relative order, moving an element forward or backward in the list depending on whether items next to it are greater or smaller. This is called a comparison sort.\par
Bubble sort algorithm \hyperref[b13]{[13]}, which is a simple sorting algorithm, works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order.\par
We considered three elements and move one element towards left or right and while moving this element other element moved one or two position towards opposite direction.\par
The main drawback of the proposed algorithm is that if smallest element is at last location then it requires n/2 iterations to move to first location. To overcome this draw back we proposed a modification to the sorting algorithm, in this for each iteration in first half the largest in the first half moved to first location of second half and in the second half, iteration start from the last element and in this iteration smallest in second half moved to the last location of first half of the elements. This procedure is repeated for n/2 times to arrange the elements in sorted order. 
\section[{II.}]{II.} 
\section[{Proposed Modification}]{Proposed Modification}\par
In each iteration in first half the largest in the first half moved to first location of second half and in the second half iteration start from the last element and in this second half iteration smallest in second half moved to the last location of first half of the elements. In successive iterations the smallest element moved to first half may be moved towards left if it is smaller than other elements in the first half same is true for the element moved to second half of the element. This procedure is repeated to arrange the elements in sorted order. For example consider set of elements 9 4 6 7 8 3 9 5 2 Novel sorting algorithm Author : SSAIST, Surampalem, India. E-mail : rayudu\textunderscore srinivas@rediffmail.com  
\section[{Algorithm}]{Algorithm}\par
Input: List of elements a[0..n-1] where n is number of elements.\par
Step 1: swap=0\par
Step 2: repeat step 3 to 6 for j=0 to n/2 where step size=1\par
Step 3: repeat step 4 for i=1 to n/2 where step size=2\par
Step 4: compare elements a[i-1],a[i] a[i+1]. If they\par
are not in order arrange them order. Set swap=1;\par
Step 5: repeat step 6 for k=n-1 to n/2 where step size=-2\par
Step 6: compare elements a[k-1], a[k] and a[k+1]. If they are not in order arrange them in order. Set swap=1;\par
Step 7: If swap=0 then given elements are in order break the outer loop else set swap=0. 
\section[{a) Algorithm Analysis}]{a) Algorithm Analysis}\par
The time for most sorting algorithms depends on the amount of data or size of the problem. \hyperref[b3]{[4]} Worst Case\par
The outer loop repeats for n/2 times.\par
In first pass of outer loop, the first inner loop repeats for (n/4) times and performs 3n/4 comparison operations and second inner loop repeats for (n/4) times and perform 3n/4 comparisons. The number of assignments performed depends on the order of elements. The maximum number of assignments performed is 2n. In the second pass (n/2) in third pass (n/2)?? Inner loop repeats n/2+n/2+ ??..n/2 terms. =n 2 /4 Therefore the worst time complexity is O(n 2 ) IV. 
\section[{Results}]{Results}\par
he time complexity of this algorithm in in worst case O(n 2 ) same as bubble sort but their actual run time differ. For better understanding the actual performance we conducted some experiments.\par
The run times are measured on a PC, (AMD athlaon 220xd) processor and1G.B. RAM under Microsoft XP operating system. These algorithms are compiled using the sun java platform complier and run under the java interpreter. The run time shown is CPU execution time measured using object of Date class. The class Date available in java util package. The elements are generated using nextInt method of Random class. The same set of elements is used for algorithms.  
\section[{Conclusion}]{Conclusion}\par
We have proposed modification to a novel sorting algorithm to sort given elements. The Proposed method uses three elements at a time to compare based on the result it arranges the elements. The proposed algorithm is easy to understand and easy to implement. We also proposed a modification of considering iterations to increase the speed of execution. The proposed algorithm has similarity like bubble sort that is in every phase one element moved to its correct location. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{figure3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.85\textwidth}}
013\\
2\\
Year\\
22\\
Volume XIII Issue XI Version I\\
D D D D D D D D ) C\\
(\\
Global Journal of Computer Science and Technology\end{longtable} \par
  {\small\itshape [Note: T © 2013 Global Journals Inc. (US)]} 
\caption{\label{tab_0}Table 1 :}\end{figure}
 			\footnote{© 2013 Global Journals Inc. (US)} 			\footnote{CEnhanced Novel Sorting Algorithm} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Reno]{b8}\label{b8} 	 		\textit{},  		 			Nevada Reno 		,  		 			Usa 		.  		 ACM 1-58113-648-X/03/0002.  		 	 
\bibitem[Bhalchandra et al. ()]{b5}\label{b5} 	 		‘A Comprehensive Note on Complexity Issues in Sorting Algorithms’.  		 			Parag Bhalchandra 		,  		 			* 		,  		 			Nilesh Deshmukh 		,  		 			Sakharam Lokhande 		,  		 			Santosh Phulari 		.  	 	 		\textit{Advances in Computational Research}  		 0975- 3273.  		2009. 1  (2)  p. .  	 
\bibitem[Estivill-Castro and Wood ()]{b9}\label{b9} 	 		‘A Survey of Adaptive Sorting Algorithms’.  		 			V Estivill-Castro 		,  		 			D Wood 		.  	 	 		\textit{Computing Surveys},  				1992. 24 p. .  	 
\bibitem[Estivill-Castro and Wood ()]{b10}\label{b10} 	 		‘A Survey of Adaptive Sorting Algorithms’.  		 			V Estivill-Castro 		,  		 			D Wood 		.  	 	 		\textit{Computing Surveys},  				1992. 24 p. .  	 
\bibitem[Hoffmann and Hofmann ()]{b11}\label{b11} 	 		‘Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics’.  		 			J Hoffmann 		,  		 			M Hofmann 		.  	 	 		\textit{8th Asian Symp. on Prog. Langs. (APLAS'10)},  				2010.  	 
\bibitem[Francesc et al. ()]{b4}\label{b4} 	 		\textit{An Analysis of selection sort using recurrence relations" Questho},  		 			J Francesc 		,  		 			Jesus Ferri 		,  		 			Albert 		.  		1996. 20 p. .  	 
\bibitem[Khan Durrani et al.]{b6}\label{b6} 	 		‘Analysis and Determination of Asymptotic Behavior Range For Popular Sorting Algorithms’.  		 			Omar Khan Durrani 		,  		 			V Shreelakshmi 		,  		 			Sushma Shetty 		,  		 			\& Vinutha 		,  		 			D 		.  	 	 		\textit{Special Issue of International Journal of Computer Science \& Informatics (IJCSI)}  		 (PRINT.  		p. .  	 	 (II, Issue-1, 2) 
\bibitem[Liu ()]{b3}\label{b3} 	 		‘Analysis of sorting algorithms’.  		 			C L Liu 		.  	 	 		\textit{Proceedings of Switching and Automata Theory, 12th Annual Symposium},  				 (Switching and Automata Theory, 12th Annual SymposiumEast Lansing, MI, USA)  		1971. p. .  	 
\bibitem[Bubble Sort: An Archaeological Algorithmic Analysis Owen Astrachan SIGCSE '03 (February 19-23)]{b7}\label{b7} 	 		\textit{Bubble Sort: An Archaeological Algorithmic Analysis Owen Astrachan SIGCSE '03},  		February 19-23.  	 
\bibitem[Malik ()]{b1}\label{b1} 	 		\textit{C++ Programming: Program Design Including Data Structures, Course Technology},  		 			D S Malik 		.  		2002. Thomson Learning.  	 
\bibitem[Satish et al. (2009)]{b12}\label{b12} 	 		‘Designing Efficient Sorting Algorithms for Manycore GPUs’.  		 			Nadathur Satish 		,  		 			Mark Harris 		,  		 			Michael Garland 		.  	 	 		\textit{23rd IEEE International Parallel and Distributed Processing Symposium},  				May 2009.  	 
\bibitem[Cormen et al. ()]{b2}\label{b2} 	 		\textit{Introduction to Algorithms},  		 			T H Cormen 		,  		 			C E Leiserson 		,  		 			R L Rivest 		,  		 			C Stein 		.  		2001. Cambridge, MA: MIT Press.  	 	 (2nd edition) 
\bibitem[Chakraborty et al.]{b13}\label{b13} 	 		\textit{On Why Parameters of Input Distributions Need be Taken Into Account For a More Precise Evaluation of Complexity for Certain Algorithms},  		 			Soubhik Chakraborty 		,  		 			Mausumi Bose 		,  		 			Kumar Sushant 		.  		 	 	 (A Research thesis) 
\bibitem[Sinapiromsaran ()]{b0}\label{b0} 	 		‘The sorted list exhibits the minimum successive difference’.  		 			Krung Sinapiromsaran 		.  	 	 		\textit{The Joint Conference on Computer Science and Software Engineering},  				November 17-18, 2005.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
