What am I doing wrong in determining the big-O of these Java functions?

What is the original VHDL code of DES algorithm?

What is the best strategy to detect a DDOS attack? And what algorithm can be used to effectively prevent it?

Do I have the right idea of Big-O for code fragments?

How do I know where to use the breadth first traversal and where to use the depth first traversal in graph problems?

Why is Thomas Cormen the most known among the CLRS algorithm authors?

Should I continue my competitive programming adventure or should I shift to machine learning?

What is the most common programming algorithm you use at work?

How do I find the shortest distance between x−2y+10=0x−2y+10=0x-2y+10=0 and y2=4xy2=4xy^2=4x?

How about learning algorithms from edx?

What will happen if, in a C program, you assign a value to an array element whose subscript exceeds the size of array?

Given that modular multiplication is efficient, why isn’t the calculation of factorial mod N (N with unknown factors) computationally efficient?

How can I design an optimized algorithm to improve the battery life and efficiency of a computing device?

What’s the best way to create a key-value based data structure in C++ supporting interprocess shared memory using C++11?

What is the easiest way to calculate the time complexity of an algorithm?

Is it important to know data structures and algorithms to become UI/UX developer at big firms like Google/Facebook/Amazon?

Which field should someone without creativity in creating new algorithms choose, OS, Graphic Computation, AI, Programming Methods, or ISs?

Why is quicksort considered as unstable sorting?

Is it possible to implement data structures by using Java?

Can a shortest path contain a negative weight cycle?