Giter Club home page Giter Club logo

udemycourse's Introduction

Introduction to Algorithms and Data structures in C++

Description A step-by-step Programming course with solved problems. You'll learn how to solve Algorithmic problems using Data Structures. I'm teaching visually with lots of examples. These are the solutions and code from the lessons.

The response was incredible, 3000+ students from 100+ countries had joined during the first month.

Reviews:

  1. "I learned a lot of things from this course. The GOLD trick was awesome." Arpan P.
  2. "I started thinking about problems in a more efficient way..." Mokshagna S.
  3. "It's deep, rich in information, consistent and dense" Laurentiu M.
  4. "It's a very good course, it focuses on building your concept." Saransh S.
  5. "Awesome, it's just awesome" Yazan R.

udemycourse's People

Contributors

andreimargeloiu avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

udemycourse's Issues

BinarySearchSpoj

Why do we use only printf or scanf when I tried using cin and cout the SPOJ said time limit exceeded. It would be beneficial if you could answer about it.
Thanks for the well-designed course

#include
using namespace std;

int main(){
int N,Q;
int left=0;
int right=0;
int mid=0;
cin>>N>>Q;
for(int i=0;i<N;i++)
cin>>A[i];
int X;
for(int i=0;i<Q;i++){
cin>>X;
left=0;
right = N-1;
mid = (left+right)/2;
int result = -1;

while(left<=right){
    if(A[mid] == X){
        result = mid;
        right=mid-1;
        mid=(left+right)/2;
    }
    else if(A[mid]>X){
        right=mid-1;
        mid=(left+right)/2;

    }
    else {
        left=mid+1;
        mid=(left+right)/2;
    }
}
cout << result<<endl;
}

}

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.