muhammad amir

hi, in my last lecture i had faced a quiz, it was related to two dimensional array.i was unable to solve it.the question is "you are required to find a generic formula of the two dimensional array that how memory is being allocated for two dimensional array ?how compiler know …

actually,in data structure couse we usually find efficiency of our code. it mean that how much our code is efficient.as your question order of growth directly proportional to time complexity and similarly time complexty directly proportional to program steps in your assignment you are required to find step count for …

actually i dont have complete concept about bigO notation that usually used to find time complexity my question is in bigO notation why we ignore constant for example f=100n we say that our algorithm has order of n time comlexity or order

hi i m a student of fast varsity lahore and doing telecommunication engineering