Added BogoSort C++ Implementation (#510)

C++ Bogosort Implementation.

Author: shreyans800755

.gitignore

@@ -54,3 +54,4 @@ $RECYCLE.BIN/
 # IDE and text editors
 .idea/*
 *.swp
+*.iml

100_Doors_Problem/C#/Davipb/HundredDoors.cs

@@ -2,7 +2,7 @@
 
 namespace HundredDoors
 {
-	public static class HundredDoors
+	public static class HundredDoors //LOATHSOME!
 	{
 		/// <summary>
 		/// Solves the 100 Doors problem
@@ -18,7 +18,7 @@ public static bool[] Solve()
 				for (int i = pass; i < doors.Length; i += pass)
 					doors[i] = !doors[i];
 
-			return doors;
+			return doors; //final door count
 		}
 	}
 }

100_Doors_Problem/C++/nixfox/100doors.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <bitset>
+
+#define DOORSNUM 100
+
+void walk_and_print(std::bitset<DOORSNUM> &doors, unsigned int cycle, bool print){
+	for(unsigned int i = 0; i < cycle;i++){
+		for(unsigned int j = i - 1; j < DOORSNUM; j+=i){
+			doors.flip(j);
+		}
+	}
+	if(print){
+		for(unsigned int i = 0; i < DOORSNUM; i++){
+			if(doors[i] == 1){
+				std::cout << "Door " << i << ": is Open"<<std::endl; 
+			}else{
+				std::cout << "Door " << i << ": is Closed"<<std::endl; 
+			}
+		}
+	}
+}
+int main(){
+	std::bitset<DOORSNUM> doors;
+	walk_and_print(doors, 100,true);
+	return 0;
+}

100_Doors_Problem/Erlang/Sweet-kid/doors_100.erl

@@ -0,0 +1,75 @@
+-module(doors_100).
+-compile(export_all).
+-import(lists).
+
+main() ->
+    %% false represents a closed door & true represents an open door
+    Doors = lists:duplicate(100, false),
+    Result = toggle_doors( Doors, 0 ),
+    io:format("Open doors:~n"),
+    print_open_doors( Result, 1),
+    OpenDoorsIndex = [ X*X || X <- lists:seq( 1, 10) ],
+    TestPassed = test_open_doors( Result, 1, OpenDoorsIndex ),
+    if TestPassed == true ->
+            io:format("~nTest passed~n");
+       true ->
+            io:format("~nTest failed~n")
+    end.
+
+test_open_doors(_, 101, _) ->
+    true;
+
+test_open_doors(Result, CurrentIndex, OpenDoorsIndex) ->
+    IsAnOpenDoor = lists:member( CurrentIndex, OpenDoorsIndex ),
+    %% index for nth should be >=1
+    Door = lists:nth( CurrentIndex, Result ),
+    if IsAnOpenDoor == true ->
+            if Door == true ->
+                    test_open_doors( Result, CurrentIndex + 1, OpenDoorsIndex );
+               true ->
+                    io:format("test failed for ~p~n", [CurrentIndex]),
+                    false
+            end;
+       true ->
+            if Door == false ->
+                    test_open_doors( Result, CurrentIndex + 1, OpenDoorsIndex );
+               true ->
+                    io:format("test failed for ~s~n", [CurrentIndex]),
+                    false
+            end
+    end.
+
+print_list([], _) ->
+    io:format("~n");
+print_list([H|T], N) ->
+    io:format("~p ", [H]),
+    if (N rem 10) == 0 ->
+            io:format("~n"),
+            print_list(T, N+1);
+       true ->
+            print_list(T, N+1)
+    end.
+
+print_open_doors([], _) ->
+    io:format("~n");
+print_open_doors([H|T], N) ->
+    if H == true ->
+            io:format("~p ",[N]),
+            print_open_doors(T, N+1);
+       true ->
+            print_open_doors(T, N+1)
+    end.
+
+toggle_doors( Doors, 100 ) -> Doors;
+toggle_doors( Doors, Turn) ->
+    toggle_doors( toggle_doors_per_turn( Doors, 1, Turn), Turn + 1 ).
+
+toggle_doors_per_turn( Doors, Current, Turn ) ->
+    if Current*(Turn+1) > 100 ->
+            Doors;
+       true ->
+            ToggledDoors = lists:sublist( Doors, Current*(Turn + 1) - 1 ) ++
+                [ not lists:nth(  Current*(Turn + 1) , Doors) ] ++
+                lists:sublist( Doors, Current*(Turn + 1) + 1, length( Doors ) - Current*(Turn + 1) + 1 ),
+            toggle_doors_per_turn( ToggledDoors, Current + 1, Turn )
+    end.

100_Doors_Problem/Perl/Sweet-kid/100_Doors.pl

@@ -0,0 +1,52 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+
+use POSIX;
+
+sub toggle_doors {
+    my ($doors, $start) = @_;
+    for( my $i = 1; ($start*$i - 1) < 100; $i++ ) {
+        $doors->[ $start*$i - 1 ] = !$doors->[ $start*$i - 1 ];
+    }
+}
+
+sub print_open_doors {
+    my ($doors) = @_;
+    print "Open doors:\n";
+    for( my $i = 0; $i < 100; $i++ ) {
+        if( $doors->[ $i ] ) {
+            print ($i + 1);
+            print " ";
+        }
+    }
+    print "\n";
+}
+
+sub test_doors {
+    my $doors = shift;
+
+    my @expected = (0) x 100 ;
+    
+    for( my $i = 1; $i <= 10; $i++ ) {
+        $expected[ ($i*$i) - 1 ] = 1;
+    }
+
+    for( my $i = 0; $i <= $#expected; $i++ ) {
+        if( $doors->[ $i ] != $expected[ $i ] ) {
+            die "test failed for index $i\n";
+        }
+    }
+
+    print "\nAll tests passed\n\n";
+}
+
+my @doors = ( 0 ) x 100;
+for( my $i = 1; $i <= 100; $i++ ) {
+    toggle_doors( \@doors, $i );
+}
+
+print_open_doors( \@doors );
+test_doors( \@doors );
+

10_Harshad_Number/Erlang/Sweet-kid/harshad_number.erl

@@ -0,0 +1,37 @@
+-module(harshad_number).
+-compile(export_all).
+
+main() ->
+    Numbers = lists:seq(1, 200),
+    HarshadNumbers = lists:filter(
+                       fun(Number) ->
+                               Digits = integer_to_list(Number),
+                               Sum = sum( Digits, 0 ),
+                               if Number rem Sum == 0 ->
+                                       true;
+                                  true ->
+                                       false
+                               end
+                               %% end if
+                       end
+                       %% end fun(Number)
+                       , Numbers),
+    Expected = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
+                12, 18, 20, 21, 24, 27, 30, 36,
+                40, 42, 45, 48, 50, 54, 60, 63,
+                70, 72, 80, 81, 84, 90, 100, 102,
+                108, 110, 111, 112, 114, 117, 120,
+                126, 132, 133, 135, 140, 144, 150,
+                152,153, 156, 162, 171, 180, 190,
+                192, 195, 198, 200],
+    if HarshadNumbers == Expected ->
+            io:format("Test passed~n");
+       true ->
+            io:format("Test failed~n")
+    end.
+
+sum([], Sum) ->
+    Sum;
+sum([H|T], Sum) ->
+    {Integer,_} = string:to_integer([H]),
+    sum(T, Sum + Integer).

10_Harshad_Number/Perl/Sweet-kid/10_Harshad_Number.pl

@@ -0,0 +1,30 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+
+use Test::More;
+
+use HarshadNumber qw(is_harshad_number);
+
+my $expected = [
+    1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
+    12, 18, 20, 21, 24, 27, 30, 36,
+    40, 42, 45, 48, 50, 54, 60, 63,
+    70, 72, 80, 81, 84, 90, 100, 102,
+    108, 110, 111, 112, 114, 117, 120,
+    126, 132, 133, 135, 140, 144, 150,
+    152,153, 156, 162, 171, 180, 190,
+    192, 195, 198, 200
+];
+
+my @result;
+for my $i( 1 .. 200 ) {
+    if( HarshadNumber::is_harshad_number( $i ) ) {
+        push @result, $i;
+    }
+}
+
+is_deeply(\@result, $expected, "Harshad numbers test passed");
+
+done_testing();

10_Harshad_Number/Perl/Sweet-kid/10_Harshad_Number.t

@@ -0,0 +1,30 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+
+use Test::More;
+
+use HarshadNumber qw(is_harshad_number);
+
+my $expected = [
+    1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
+    12, 18, 20, 21, 24, 27, 30, 36,
+    40, 42, 45, 48, 50, 54, 60, 63,
+    70, 72, 80, 81, 84, 90, 100, 102,
+    108, 110, 111, 112, 114, 117, 120,
+    126, 132, 133, 135, 140, 144, 150,
+    152,153, 156, 162, 171, 180, 190,
+    192, 195, 198, 200
+];
+
+my @result;
+for my $i( 1 .. 200 ) {
+    if( HarshadNumber::is_harshad_number( $i ) ) {
+        push @result, $i;
+    }
+}
+
+is_deeply(\@result, $expected, "Harshad numbers test passed");
+
+done_testing();

10_Harshad_Number/Ruby

@@ -0,0 +1,12 @@
+# /usr/bin/ruby
+
+for i in 1..201 do
+	sum = i.to_s.each_char.map {|c| c.to_i }.reduce(:+)
+    
+    if i % sum == 0 then
+    	puts "#{i} is harshad"
+    else 
+    	puts "#{i} isn`t harshad"
+    end
+end
+

Ackermann/C#/xCyborg/Ackermann.cs

@@ -0,0 +1,42 @@
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+using System.Threading.Tasks;
+
+namespace Ackermann
+{
+    class Program
+    {
+        static void Main(string[] args)
+        {
+            Repeat:
+
+            Console.WriteLine("Input number A: ");
+            long num_a = Convert.ToInt64(Console.ReadLine());
+
+            Console.WriteLine("Input number B: ");
+            long num_b = Convert.ToInt64(Console.ReadLine());
+
+            long result = Ackermann(num_a, num_b);
+            Console.WriteLine("A(m,n)="+result);
+
+            goto Repeat;
+        }
+        public static long Ackermann(long m, long n)
+        {
+            if (m == 0)
+            {
+                return (n + 1);
+            }
+            else if (m > 0 && n == 0)
+            {
+                return Ackermann(m - 1, 1);
+            }
+            else
+            {
+                return Ackermann(m - 1, Ackermann(m, n - 1));
+            }
+        }
+    }
+}

Average/C++/nixfox/avg.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+#include <list>
+template <typename T>
+T average(T const* nums, int range){
+	T sum = nums[range-1];
+	for(unsigned int i = 0; i < (range-1); i++){
+		sum += nums[i];
+	}
+	return sum / range;
+}
+int main(){
+	// ints
+	int nums_i[] = {1,2,3,40,5,6,7,8,100,560,2136};
+	std::cout << average(nums_i,sizeof(nums_i)/sizeof(int))<<std::endl;
+	// floats
+	float nums_f[] = {20.60,45.213,23.78,90.04,29,01};
+	std::cout << average(nums_f, sizeof(nums_f)/sizeof(float))<<std::endl;
+}
+