# Category Archives: A ll Codes

## QuickSort

Analaysis though it seems little bit tough to me:

HackerRank video:

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:

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

Another good one for understanding(I think it’s the best one):

Pseudocode available in the above video:

implemented code:

Quick Sorting in Process

Time and Space complexity: Best Case : omega(nlogn)
Worst case: O(n^2)

See this video to clear up the skills:

## Print Hackerearth

I am implementing the solution after seeing the code:

code:

## BigInteger in Java and C++

code:

for c++ this link link or google search is good but i didn’t found any goood solution yet:
http://codeforces.com/blog/entry/16380

java:

BigInt Sum:

code:

## Basics of Implementation – Hackerearth

Vowel count in a string:
code:

Count Digit:

## C++ Vector push_back()…pop_back()

Best Video Explained:

code:

some bugs  here but understood the implementation:

## Algorithm: Euler’s GCD

code:

more optimized:

Recursive:

http://www.progkriya.org/gyan/basic-number-theory.html#section3

code:

I/O:

code:

code:

code:

## Data Structure: Queue

Stack VS Queue difference:

code:

My implementation:

Another Video:

Code from the video Mycodeschool(Using circular queue):

Theory:

Bangla:

গ্রাফ থিওরিতে হাতেখড়ি-৪(ব্রেডথ ফার্স্ট সার্চ)

Video:

code implementation:

code:

Input:

Output:

Another code tried to write from the pseudocode is: