Hello Codeforces!

New lesson in English EDU section. This time I will talk about binary search.

More about EDU section you can read in this post.

Hope it will be helpful, enjoy!

# | User | Rating |
---|---|---|

1 | tourist | 3682 |

2 | ecnerwala | 3603 |

3 | Benq | 3549 |

4 | Radewoosh | 3494 |

5 | Petr | 3452 |

6 | ksun48 | 3413 |

7 | maroonrk | 3406 |

8 | Miracle03 | 3314 |

9 | scott_wu | 3313 |

10 | Um_nik | 3299 |

# | User | Contrib. |
---|---|---|

1 | 1-gon | 214 |

2 | Errichto | 189 |

3 | awoo | 188 |

4 | rng_58 | 187 |

5 | SecondThread | 186 |

6 | Um_nik | 179 |

7 | Ashishgup | 177 |

8 | maroonrk | 172 |

8 | vovuh | 172 |

8 | antontrygubO_o | 172 |

Hello Codeforces!

New lesson in English EDU section. This time I will talk about binary search.

More about EDU section you can read in this post.

Hope it will be helpful, enjoy!

↑

↓

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/18/2021 10:50:30 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

Finally !!

Could by any chance lessons be sorted in increasing order of difficulty? I am feeling like Binary Search should be covered before segment trees. Perhaps it could be easier for beginners to wrap their head around the problems that way.

I try to choose topics of different difficulty and from various sections, and I do it on purpose. One of the reasons is that EDU is in beta, and we want to try how it works for different topics. Another reason is to give something interesting for everybody. I don't consider EDU to be a regular online course, it's more like wikipedia. Eventually we will fill it with all interesting topics.

Nice timing .. I was just analysing/practicing binary search

Just Awesome! keep it up sir

I think Binary search should have been the first

read pashka's reply to one of the comments above yours

Must say, the T-shirt is cool!

Quite confused about Suffix Array and Segment tree comes before binary search.

Thanks for this wonderful course ! Will try to solve all the practice problems.

Thanks pashka. We are really grateful to you. Your lecture is easy to understand.

is this rated for division 3?

Hi, Thanks for these awesome tutorials. I have a suggestion to please make some series on number theory and covering problems on concepts of combinatorics, probability and mathematical deductions.

Stop it! If you reveal the secrets we won't be able to have any interactive problems anymore!

You sure don't enjoy contributing in open source projects, do you ?

I enjoy. like and subscribe https://github.com/farmersrice

Will sure do!

I More Than A University. Awesome Explained Sir!!

Please do one on Graph algorithms!

I can't hear audio for the section on Binary Search on Answer. I went on YouTube and I could hear audio but not for EDU section. :(

Binary search and linear search in Hindi. https://youtu.be/SU0jmz4NqCI

Really helpful, I think it will make me good in implementation of binary search Algo.

Hey,can anyone explain where the problem is in the problem(same kinda other problem).The problem looks like that..... https://codeforces.com/gym/102697/problem/014 and my code is............

## include <bits/stdc++.h>

using namespace std; int main(){ int n,m; cin>>n>>m; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ string s; cin>>s; int count = 0; for(int i = 0;i < s.size();i++){ if (s[i] == 'x'){ count++; } } cout<<count<<"\n"; } } }

Next should be dp.

I am very poor at dp.

Thanks pashka .

Why is nobody talking about his shirt

IT's MOre than a university