Category Archives: Algorithm

Pseudo Code

Pseudocode details I was searching for so long:

https://en.wikipedia.org/wiki/Pseudocode

Pseudocode guideline from wiki references:
http://www.cs.cornell.edu/courses/cs482/2003su/handouts/pseudocode.pdf

QuickSort

Youtube Video:

Analaysis though it seems little bit tough to me:

HackerRank video:

MIT video:
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-4-quicksort-randomized-algorithms/

Pseudo Code from upper Youtube vid:

 

Implementation:

Slightly edited in *A to A[]:

Some change with before and after show:

Complete Quicksort Implementation and taking user input:

Output from the above code:

Geeks for geeks:
http://quiz.geeksforgeeks.org/quick-sort/
http://www.practice.geeksforgeeks.org/problem-page.php?pid=700151

From geeks for geeks but may be there might be some problems there

ideone example: http://ideone.com/oWbONR
Others Code:
http://www.cc.gatech.edu/classes/cs3158_98_fall/quicksort.html
Recursive:
http://www.algolist.net/Algorithms/Sorting/Quicksort
CLRS:
http://www.bowdoin.edu/~ltoma/teaching/cs231/fall09/Lectures/5-quicksort/quicksort.pdf

Google Search Terms:
https://www.google.com/webhp?sourceid=chrome-instant&rlz=1C1PRFC_enBD706BD706&ion=1&espv=2&ie=UTF-8#q=quick+sort+pseudocode&*

DS Journery of my Alone

We learn data structure to organize data to manipulate data.

Career Benefits of Competitive Programming

5 Career Benefits of Competitive Programming

CSE Motivation

Best, Average, Worst Case

cheat sheet:
http://bigocheatsheet.com/
Good for Programmers:


It’s also good:

It’s good for space complexity and cost.


Golden rules :

Not good for programmers but okay:

Will watch it later:

Asymptotiic Notation

 

অ্যালগোরিদম কমপ্লেক্সিটি(বিগ “O” নোটেশন)

http://pages.cs.wisc.edu/~vernon/cs367/notes/3.COMPLEXITY.html

http://discrete.gr/complexity/

http://50f7.blogspot.com/

For Upper Bound Lower Bound Clear:

http://cs50.wiki/Big+O+notation

C revise

 

Monk and Welcome Problem

Another Problem:

 

CP Resource

https://www.quora.com/What-are-some-good-resources-to-learn-C++-for-competitive-programming

http://blog.macacm.org/2016/06/courses-and-resources-to-excel-in.html

https://www.quora.com/What-was-Anudeep-Nekkantis-Competitive-Programming-strategy-to-become-35th-in-Global-ranking-in-just-6-7-months

 

http://www.spoj.com/problems/ARRAYSUB/

 

From beginner to expert in competitive programming.

https://www.quora.com/What-are-some-good-courses-on-competitive-programming

Algorithms

https://algo.is/

https://www.quora.com/Can-I-become-a-really-good-self-taught-programmer

Notes and courses for competitive programming

https://www.quora.com/India-Im-yellow-on-Topcoder-the-best-in-my-college-I-am-a-3rd-year-ECE-B-tech-student-with-arrears-and-I-have-CGPA-of-4-0-on-a-scale-of-10-0-I-have-immense-hatred-towards-my-ECE-branch-Im-afraid-I-might-not-get-placed-because-of-my-low-CGPA-What-should-I-do

Course:

https://www.udemy.com/introduction-to-algorithms-and-data-structures-in-c/

https://www.udemy.com/from-0-to-1-c-programming/

https://www.quora.com/How-did-Anudeep-Nekkanti-become-so-good-at-competitive-programming

Algorithm Journey A to Z revise

URI Online Judge | 1030 Flavious Josephus Legend

This is level 3 problem so will do it later. But this video will help for  sure.

 

How to count numbers from string ?

code:

 

Depth Firtst Search(DFS) Algorithm Explanation and Implementation

 

 

References:
One of my classmates blog link: http://programminghelpbd.blogspot.com/2014/06/breadth-first-search-dfs-in-java.html
and this ppt : https://drive.google.com/file/d/0B0sCkwd_qKgJZEJzS1pWeXNmNUE/edit
CLRS website: http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/depthSearch.htm

Shafayet Ashraf: http://www.shafaetsplanet.com/planetcoding/?p=973

saurabhschool youtube link : https://www.youtube.com/watch?v=gCNsAKkUHPM

Youtube video of Mifta Sintaha:

and here is also a good implementation:
http://electrofriends.com/source-codes/software-programs/cpp-programs/cpp-data-structure/c-programs-for-the-implementation-of-depth-first-searchdfs-for-a-given-graph/comment-page-1/#comments

Java array basics: http://www.tutorialspoint.com/java/java_arrays.htm

What does it actually mean in an array limit 0≤A[i]≤10^10 ?

Its means that the value of A[i] must be remained between 0 to 10000000000