kottans / algorithm_club

Repo for participating in cooperative survival MOOC

Kottans

This repo contains documents regarding general Kottans organization matters.

Endorsements

This section contains a register of Kottans badge endorsements.

If a badge is not among top-level list items just add one. When adding an entry use any existing one as a reference.

• 

  • suchov endorsed by sudodoki [day 1 of kottans]

• 

  • zonzujiro endorsed by suchov [2018-11-04]

  • sudodoki endorsed by suchov [2018-11-04]

  • lempiy endorsed by suchov [2018-11-04]

  • shvaikalesh endorsed by suchov [2018-11-05]

• 

  • AMashoshyna endorsed by suchov [2019-02-07]

  • A-Ostrovnyy endorsed by suchov [2019-02-07]

  • IgorKurkov endorsed by suchov [2019-02-07]

  • lempiy endorsed by suchov [2019-02-07]

  • OleksiyRudenko endorsed by suchov [2019-02-07]

  • yevhenorlov endorsed by suchov [2019-02-07]

  • zonzujiro endorsed by suchov [2019-02-07]

• 

  • beta-version-profile endorsed by suchov [2019-02-07]

  • kalash14 endorsed by suchov [2019-02-07]

  • o-msh endorsed by suchov [2019-02-07]

  • Oodmincheg endorsed by suchov [2019-02-07]

  • Roman-Halenko endorsed by suchov [2019-02-07]

• 

  • KurosavaAkira endorsed by OleksiyRudenko [2018-11-01] (proof)

• 

  • Karasb888 endorsed by yevhenorlov [2018-11-04] (proof)

• 

  • ApolloSG endorsed by OleksiyRudenko [2018-11-14] (proof)
  • Karasb888 endorsed by OleksiyRudenko [2018-12-04] (proof)
  • Zihfred endorsed by OleksiyRudenko [2018-12-08] (proof)

• 

  • maxovsanyuk endorsed by OleksiyRudenko [2018-11-29] (proof)

• 

  • justdevway endorsed by OleksiyRudenko [2018-12-21] (proof)
  • linkqwd endorsed by OleksiyRudenko [2019-01-01] (proof)

algorithm_club's Issues

skiena 2-52 top challenge

continuing the 2-51 problem

Six pirates must divide $300 dollars among themselves. The division is to proceed
as follows. The senior pirate proposes a way to divide the money. Then the pirates
vote. If the senior pirate gets at least half the votes he wins, and that division
remains. If he doesn’t, he is killed and then the next senior-most pirate gets a
chance to do the division. Now you have to tell what will happen and why (i.e.
, how many pirates survive and how the division is done)? All the pirates are
intelligent and the first priority is to stay alive and the next priority is to get as
much money as possible.

---

Task

Reconsider the pirate problem above, where only one indivisible dollar is to be
divided. Who gets the dollar and how many are killed?

Complete homework 3 task and theory

Okay guys, you are experienced already. Molon labe.

Week 1 MOOC TASK Alimova

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

skiena 2-47

You are given 10 bags of gold coins. Nine bags contain coins that each weigh 10
grams. One bag contains all false coins that weigh one gram less. You must identify
this bag in just one weighing. You have a digital balance that reports the weight of
what is placed on it.

week 2 mooc task

Complete theory sections for Homework 2

• The master method
• Quicksort - Algorithm
• Quicksort - Analysis
• Probability Review

Complete Homework 2

• Pass Problem Set 2

put the screenshot with results in your Theory folder

• Complete Programming assignment 2

put the code of your solution in your week 2 folder

• Work through optional theory problems

week 2 mooc task

Complete theory sections for Homework 2

• The master method
• Quicksort - Algorithm
• Quicksort - Analysis
• Probability Review

Complete Homework 2

• Pass Problem Set 2

put the screenshot with results in your Theory folder

• Complete Programming assignment 2

put the code of your solution in your week 2 folder

• Work through optional theory problems

test issue

for kottans/kottans-course-bootstrap#14

Week 1 MOOC TASK /dumareckii/

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC TASK /veligura/

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

skiena 2-51 top challenge

Six pirates must divide $300 dollars among themselves. The division is to proceed
as follows. The senior pirate proposes a way to divide the money. Then the pirates
vote. If the senior pirate gets at least half the votes he wins, and that division
remains. If he doesn’t, he is killed and then the next senior-most pirate gets a
chance to do the division. Now you have to tell what will happen and why (i.e.
, how many pirates survive and how the division is done)? All the pirates are
intelligent and the first priority is to stay alive and the next priority is to get as
much money as possible.

week 2 mooc task

Complete theory sections for Homework 2

• The master method
• Quicksort - Algorithm
• Quicksort - Analysis
• Probability Review

Complete Homework 2

• Pass Problem Set 2

put the screenshot with results in your Theory folder

• Complete Programming assignment 2

put the code of your solution in your week 2 folder

• Work through optional theory problems

homework 3

add a license

let's add a license so ppl know how they can use/share our materials

Week 1 MOOC TASK

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC TASK

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

complete homework 3

Okay guys, you are experienced already. Molon labe.

Add members to algorithm team

hedgehogus
lysenko-sergei-developer
aleshaoleg
dumareckii
programulya
Alimova
veligura
ameks94
dm3shafieiev
amashoshyna
later +2 members
read permissions on this repo.

@AMashoshyna @suchov pls assign this issue.
additionally may i ask for @quodnon write permission for this repo: to accept PR's and assign issues?

Week 1 MOOC TASK

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

dm3shafieiev

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC Task

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

create gitter room for participants

In order not to spread over different messengers, let's stick to our familiar and beloved by someone gitter

week 2 mooc task

Complete theory sections for Homework 2

• The master method
• Quicksort - Algorithm
• Quicksort - Analysis
• Probability Review

Complete Homework 2

• Pass Problem Set 2

put the screenshot with results in your Theory folder

• Complete Programming assignment 2

put the code of your solution in your week 2 folder

• Work through optional theory problems

"Oleksandr Siryi"

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

ameks94

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 mooc task

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC Task

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • Introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put the screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC TASK

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC Task

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC TASK

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

skiena 2-48

You have eight balls all of the same sizes. Seven of them weigh the same, and one of them weighs slightly more. How can you find the ball that is heavier by using a balance and only two weighings?

week1 mooc task

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Week 1 MOOC task

• Fork this repo
• Create folder tasks\%username%\Theory
• Create folder tasks\%username%\week1
• Complete sections
  • introduction
  • Asymptotic analysis
  • Divide and conquer algorithms
• Pass theoretical assessments from Homework 1
  • put a screenshot with your grade into \Theory folder
• Complete Homework 1
  • put solution code into \week 1 folder

Skiena 2-45

Consider the following algorithm to find the minimum element in an array
of numbers A[0,...,n]. One extra variable tmp is allocated to hold the current
minimum value. Start from A[0]; ”tmp” is compared against A[1], A[2], ..., A[N]
in order. When A[i] <tmp, tmp = A[i]. What is the expected number of times that
the assignment operation tmp = A[i] is performed?

skiena 2-46

You have a 100-story building and a couple of marbles. You must identify the
lowest floor for which a marble will break if you drop it from this floor. How fast
can you find this floor if you are given an infinite supply of marbles? What if you
have only two marbles?