//--------------------

//Edouard Moureaux

//February 2016

//

// Problem URL: 

// https://www.hackerrank.com/challenges/functions-and-fractals-sierpinski-triangles

//--------------------

namespace FunctionalProgramming.Recursion

​

module Triangles =

    open System

    type Rectangle = { Origin : int * int ; Width : int ; Height : int }

​

    let drawTriangle rect =

        let bottom, left = rect.Origin

        let right, top = left + rect.Width , bottom + rect.Height

​

        [|  for j in [bottom .. top] do

                for i in [left .. right] do

                    if i < j || i > (right - j) then

                        yield (i,j) , "_"

                    else

                        yield (i,j) , "1"|]

​

    let splitRect rect = 

        let width = rect.Width / 2

        let height = rect.Height / 2

        let r1 = { Origin = rect.Origin ; Width = width ; Height = height}

​

        let r2 = { Origin = rect.Origin ; Width = rect.Width / 2 ; Height = rect.Height / 2}

​

    let rec fractalize rect =

        function

            | 0 -> id

            | 1 -> 

​

    let printgrid grid =

        let lim = ( Array2D.length2 grid ) - 1

        let str = grid |> Array2D.map (fun elem -> elem.ToString() )

        for j in [0.. lim ] do 

            printfn "%s" <| String.concat "" str.[*, (lim - j)]

​

​

    ///Grid Size

    let width = 63

    let height = 32 

​

​

​

​

​