Algorithm ekak run karadi, ape input eka change wena widiya anuwa worst possible case ekedi execute wenna yana time eka thama BigOh.
Ex:
1). codes without loops
Saamanya if condition ekaka body ekak or fn body codes input eka matha depend wen naa, ethakota ewa constant time.
if (condition) {
// code1
// code2
}
methana input eka mokak unath oya athule tiyena line dekama run wenawa, eka input eka anuwa change wena naa. so O(1)
2). Looping arrays
Array ekak elements print karadi apita mulu array ekama traverse karana sidda wenawa, eka depende wenna array eke size eka anuwa. Elements 100k nm 100times traverse karana wenawa array eka.
for (i=0li<ar.length;i++)
print(ar)
So, array traverse O(N)
3). Looping multidim arrays
2D arrays traverse karadi, time O(n^2)
for (i=0;i<ar.length;i++)
for (j=0;j<ar.length;j++)
print(ar[j])
etc...
hope this helps