2012年12月22日土曜日

開発環境

『初めてのプログラミング 第2版』(Chris Pine 著、長尾 高弘 訳、オライリー・ジャパン、2010年、ISBN978-4-87311-469-9)の 10章(章全部で復習), 10.3(練習問題)シャッフル(再帰) を解いてみる。

その他参考書籍

シャッフル(再帰)

コード(BBEdit)

sample.rb

#!/usr/bin/env ruby1.9
# -*- coding: utf-8 -*-

def shuffle some_array
  recursive_shuffle some_array, []
end
def recursive_shuffle some_array, shuffled_array
  return shuffled_array if some_array.length == 0
  a = Array.new(some_array)
  r = rand a.length
  shuffled_array.push(a.slice(r))
  a = a.slice(0, r) + a.slice(r + 1, a.length)
  recursive_shuffle a, shuffled_array
end

a1 = [1,2,3,4,5]
a2 = %w[a b c d e]
a3 = [1,2,3,4,5,'a','b','c','d','e']
[a1, a2, a3].each do |a|
  shuffled_a = shuffle a
  puts "シャッフル前: #{a}"
  puts "シャッフル後: #{shuffled_a}"
end

入出力結果(Terminal)

$ ./sample.rb
シャッフル前: [1, 2, 3, 4, 5]
シャッフル後: [1, 4, 3, 5, 2]
シャッフル前: ["a", "b", "c", "d", "e"]
シャッフル後: ["e", "a", "d", "c", "b"]
シャッフル前: [1, 2, 3, 4, 5, "a", "b", "c", "d", "e"]
シャッフル後: [3, "a", 2, "d", "c", 5, "b", 4, "e", 1]
$

ちなみにJavaScriptの場合。

コード(BBEdit)

function shuffle(some_array){
  return recursive_shuffle(some_array, []);
}
function recursive_shuffle(some_array, shuffled_array){
  if(some_array.length === 0) return shuffled_array;
  var a = [];
  for(var i = 0; i < some_array.length; i++){
    a[i] = some_array[i];
  }
  var r = Math.floor(Math.random() * a.length);
  var o = a.splice(r,1);
  shuffled_array.push(o[0]);
  return recursive_shuffle(a, shuffled_array);  
}
var result = "";
var a1 = [1,2,3,4,5];
var a2 = "abcde".split("");
var a3 = [1,2,3,4,5,'a','b','c','d','e'];
var a = [a1, a2, a3];
for(var i = 0; i < a.length; i++){
  var shuffled_a = shuffle(a[i]);
  result += "シャッフル前: " + a[i] + "\n" +
    "シャッフル後: " + shuffled_a + "\n";
}
$('#pre0').text(result);


pythonの場合。

sample.py

コード(BBEdit)

#!/usr/bin/env python3.3
# -*- coding: utf-8 -*-

def shuffle(some_list):
    return recursive_shuffle(some_list, [])

def recursive_shuffle(some_list, shuffled_list):
    if len(some_list) == 0: return shuffled_list
    l = some_list[:]
    import random
    r = random.randint(0, len(l) - 1)
    shuffled_list.append(l.pop(r))
    return recursive_shuffle(l, shuffled_list)

l1 = [1,2,3,4,5]
l2 = ['a','b','c','d','e']
l3 = [1,2,3,4,5,'a','b','c','d','e']

for l in [l1,l2,l3]:
    shuffled_l = shuffle(l)
    print("シャッフル前: {0}".format(l))
    print("シャッフル後: {0}".format(shuffled_l))

入出力結果(Terminal)

$ ./sample.py
シャッフル前: [1, 2, 3, 4, 5]
シャッフル後: [4, 3, 1, 5, 2]
シャッフル前: ['a', 'b', 'c', 'd', 'e']
シャッフル後: ['c', 'd', 'e', 'a', 'b']
シャッフル前: [1, 2, 3, 4, 5, 'a', 'b', 'c', 'd', 'e']
シャッフル後: ['b', 4, 'c', 5, 1, 3, 'e', 'd', 2, 'a']
$

perlの場合。

sample.pl

コード(BBEdit)

#!/usr/bin/env perl
use strict;
use warnings;
use utf8;
use 5.016;
binmode STDIN, ":utf8";
binmode STDOUT, ":utf8";

sub shuffle{
  my $some_array = shift;
  my @shuffled_array = ();
  recursive_shuffle($some_array, \@shuffled_array);
}
sub recursive_shuffle{
  my($some_array, $shuffled_array) = @_;
  return @$shuffled_array if scalar @$some_array == 0;
  my @a = map{$_} @$some_array;
  push @$shuffled_array, splice(@a, rand(scalar @a), 1);
  recursive_shuffle(\@a, $shuffled_array);
}

my @a1 = (1..5);
my @a2 = ('a' .. 'e');
my @a3 = (1..5, 'a' .. 'e');
for(\@a1, \@a2, \@a3){
  my @shuffled_a = shuffle $_;
  print "シャッフル前: @$_\n";
  print "シャッフル後: @shuffled_a\n"
}

入出力結果(Terminal)

$ ./sample.pl
シャッフル前: 1 2 3 4 5
シャッフル後: 4 1 2 3 5
シャッフル前: a b c d e
シャッフル後: c e a b d
シャッフル前: 1 2 3 4 5 a b c d e
シャッフル後: 2 e 3 b d a 1 5 4 c
$

0 コメント:

コメントを投稿