Sequential search has a time complexity of 0(n), and binary search has a time complexity of 0(log(n)), What will be the difference when the size n is 1000? 
 

The following program

main $\left(\right)$

{$int i =2;$

$\left\{int i=4, j=5; print f\left("\%d\%",i,j\right);\right\}$

$printf\left("\%d\%d",i,j\right);$}

What is/are the main difference(s) between the $3^{\mathrm{rd}}$ and $4^{\mathrm{th}}$ generation languages?

(i) Both follow procedural code.

(ii) Third generation languages are mostly compiled languages.

(iii) Fourth generation languages are in-line with the minimum work and skill concept.

(iv) Third generation languages are user friendly and have intelligent default options.