pashka's blog

EDU: Binary Search
By pashka, history, 8 months ago, In English

Hello Codeforces!

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

Go to EDU →

More about EDU section you can read in this post.

Hope it will be helpful, enjoy!

 
 
 
 
  • Vote: I like it
  • +710
  • Vote: I do not like it

Comments Comments (24)
»
8 months ago, # |
  Vote: I like it +21 Vote: I do not like it

Finally !!

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

→ Reply
  • »
    »
    8 months ago, # ^ |
      Vote: I like it +109 Vote: I do not like it

    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.

    → Reply
»
8 months ago, # |
  Vote: I like it +9 Vote: I do not like it

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

Just Awesome! keep it up sir

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I think Binary search should have been the first

→ Reply
  • »
    »
    8 months ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

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

    → Reply
»
8 months ago, # |
  Vote: I like it +21 Vote: I do not like it

Must say, the T-shirt is cool!

→ Reply
»
8 months ago, # |
  Vote: I like it +20 Vote: I do not like it

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

→ Reply
»
8 months ago, # |
  Vote: I like it +6 Vote: I do not like it

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

→ Reply
»
8 months ago, # |
  Vote: I like it -6 Vote: I do not like it

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

→ Reply
»
8 months ago, # |
  Vote: I like it -33 Vote: I do not like it

is this rated for division 3?

→ Reply
»
8 months ago, # |
  Vote: I like it +10 Vote: I do not like it

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.

→ Reply
»
8 months ago, # |
  Vote: I like it +39 Vote: I do not like it

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

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I More Than A University. Awesome Explained Sir!!

→ Reply
»
8 months ago, # |
  Vote: I like it +2 Vote: I do not like it

Please do one on Graph algorithms!

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

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. :(

→ Reply
»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
8 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
8 months ago, # |
  Vote: I like it -16 Vote: I do not like it

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"; } } }

→ Reply
»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Next should be dp.

I am very poor at dp.

Thanks pashka .

→ Reply
»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why is nobody talking about his shirt

IT's MOre than a university

→ Reply