stoimen

<?php
  // unordered list
  $arr = array(1, 2, 3, 3.14, 5, 4, 6, 9, 8);
  
  // searched value
  $x = 3.14;
  $index = count($arr);
  
  while ($arr[$index--] != $x);
  

stoimen

<?php
  // unordered list
  $arr = array(1, 2, 3, 3.14, 5, 4, 6, 9, 8);

  // searched value
  $x = 3.14;
  $length = count($arr);
  $index = null;

  for ($i = 0; $i < $length; $i++) {

stoimen

(function() {
  var sequential = function(haystack, needle) {
    var i = 0,
      len = haystack.length
      ;

    for (; i < len; i++) {
      if (haystack[i] === needle) {
        return true;
      }

stoimen

<?php
  /**
   * Performs a sequential search using sentinel
   * and changes the array after the value is found
   *
   * @param array $arr
   * @param mixed $value
   */
  function sequential_search(&$arr, $value)
  {

stoimen

<?php
function eratosthenes_sieve(&$sieve, $n) {
 $i = 2;

 while ($i <= $n) {
  if ($sieve[$i] == 0) {
   echo $i;

   $j = $i;
   while ($j <= $n) {

stoimen

array.filter(function(elem, index, self) {
  return self.indexOf(elem) === index;
});

stoimen

<?php

  // unordered list
  $arr = array(1, 2, 3, 3.14, 5, 4, 6, 9, 8);

  // searched value
  $x = 3.14;
  $index = null;

  for ($i = 0; $i < count($arr); $i++) {

stoimen

(function(root) {

  function sequential(list, item) {
    for (var i = 0, l = list.length; i < l; i++) {
      if (list[i] == item) {
        return i;
      }
    }

    return -1;

stoimen

var sequential = function(list, item) {
  for (var i = 0, l = list.length; i < l; i++) {
    if (list[i] == item) {
      return i;
    }
  }

  return -1;
};

stoimen

<?php
    $list = array(3,4,2,5,6,7,8,2,5,1,4,4,6);

    function minimum($list)
    {
    	$len = count($list);
    	$minimum = $list[0];

    	for ($i = 1; $i < $len; $i++) {
    		if ($minimum > $list[$i]) {