Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 2 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Programming Posted 23 May 2017 My Price 6.00

reate a 10X10 maze using union find algorithm.

 

Create a 10X10 maze using union find algorithm. Find the path to traverse through the maze.
 
 

Answers

Alpha Geek
(8)
Status NEW Posted 23 May 2017 08:05 AM My Price 6.00

-----------

Attachments

1495529387-589202_1_Sample-output.png
file 1495529388-Answer.docx preview (252 words )
C-----------rea-----------te -----------a 1-----------0X1-----------0 m-----------aze----------- us-----------ing----------- un-----------ion----------- fi-----------nd -----------alg-----------ori-----------thm-----------. F-----------ind----------- th-----------e p-----------ath----------- to----------- tr-----------ave-----------rse----------- th-----------rou-----------gh -----------the----------- ma-----------ze.----------- M-----------ay -----------22 -----------201-----------7 0-----------7:0-----------5 P-----------M -----------pub-----------lic----------- cl-----------ass----------- He-----------llo-----------Wor-----------ld{----------- st-----------ati-----------c b-----------ool-----------ean----------- ma-----------zeS-----------olv-----------er(-----------cha-----------r[]-----------[] -----------maz-----------e, -----------int-----------[][-----------] s-----------olu-----------tio-----------n, -----------int----------- i,----------- in-----------t j-----------,in-----------t N-----------) {----------- if-----------(i -----------== -----------N-1----------- &a-----------mp;-----------amp-----------;&a-----------mp;-----------amp-----------; j----------- ==----------- N------------1) -----------{ s-----------olu-----------tio-----------n[i-----------][j-----------] =----------- 1;----------- re-----------tur-----------n t-----------rue-----------; }----------- if-----------(i -----------&am-----------p;g-----------t;=----------- 0 -----------&am-----------p;a-----------mp;-----------&am-----------p;a-----------mp;----------- i -----------= 0----------- &a-----------mp;-----------amp-----------;&a-----------mp;-----------amp-----------; j----------- { -----------sol-----------uti-----------on[-----------i][-----------j] -----------= 1-----------; /-----------/ a-----------dd -----------maz-----------e[i-----------][j-----------] t-----------o t-----------he -----------sol-----------uti-----------on -----------if -----------(ma-----------zeS-----------olv-----------er(-----------maz-----------e,
Not Rated(0)