We present purely functional implementations of queues and double-ended queues (deques) requiring only O(1) time per operation in the worst case. Our algorithms are considerably simpler than previous designs with the same bounds. The inspiration for our approach is the incremental behavior of certain functions on lazy lists.

this paper analyzes the history of russian settlements in the northern provinces of iran in the early 20th century. these settlements developed in what was defined as the russian sphere of influence by the anglo-russian convention of 1907 and, unlike in the caucasus of central asia, preceded a military conquest. russian colonization in iran started as a spontaneous peasant migration in 1907 and...

For practical reasons, surveys that aim for a large number of respondents tend to restrict themselves closed-ended responses. Despite potentially bringing richer insights, the use open-ended questions poses great challenges in terms extracting useful information while significantly increasing analysis time. Nevertheless, automatic text techniques speed up In this research, we explore potential ...

hospitalization of child is one of the most stressful events of life for parents and children. this fear and stress may affect the process of treatment. since there is no information available about the source of distress and needs of iranian parents during the inpatient care of their children, we designed a research in order to discover the main source of worries and fears among parents. in th...

The purpose of this study is to investigate the relationship between technological factors on student learning that affect result in Mathematics subject. findings are based questionnaire and test distributed among students SMK Lembah Subang. research used random sampling 60 Form 4 Data were collected through close-ended open-ended questions using a Likert scale. pre-test post-test conducted mea...