How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?
Journal Title: Annals. Computer Science Series - Year 2010, Vol 8, Issue 2
Abstract
The present paper examines the behavior of Shift-insertion sort (insertion sort with shifting) for normal distribution inputs and is in continuation of our earlier work on this new algorithm for discrete distribution inputs, namely, negative binomial. Shift insertion sort found more sensitive for main effects but not for all interaction effects compared to conventional insertion sort.
Authors and Affiliations
Mita Pal, Soubhik Chakraborty, N. C. Mahanti
Proposal of a Qualification and Selection of a Software for Analysis and Monitoring of Search Engines
In order to measure website visibility in search engines, there are softwares for analytics and referencing follow-up. They permit to quantify website's efficacity of referencing and optimize its positionning in search e...
Multimedia Application for Solving a Sudoku Game<br /> <br />
This article explains the way in which, with the help of Action Script 3 in combination with Flash, a method of solving Sudoku game was implemented, through searching for the certain numbers and after that trying to gues...
Steady Flow of a Reactive MHD Fluid through a Permeable Pipe under Optically Thick Limit Radiation
his research work investigates the analytical solution of the temperature profile distribution of a one-dimensional fluid under the influence of magnetic fluid strength of a reactive hydromagnetic fluid flow through poro...
Kerberos Authentication in Wireless Sensor Networks
We proposed an authentication mechanism in the wireless sensor network. Sensor network uses the Kerberos authentication scheme for the authentication of bases station in the network. Kerberos provides a centralized authe...
Proposition d’une méthode de qualification et de sélection d’un logiciel d’analyse et de suivi du référencement dans les moteurs de recherche