Skip to main content

Disclaimer

 

Disclaimer for icancodebetter

If you require any more information or have any questions about our site's disclaimer, please feel free to contact us by email at sachu132001@gmail.com. 

Disclaimers for icancodebetter

All the information on this website - https://icancodebetter.blogspot.com/ - is published in good faith and for general information purpose only. icancodebetter does not make any warranties about the completeness, reliability and accuracy of this information. Any action you take upon the information you find on this website (icancodebetter), is strictly at your own risk. icancodebetter will not be liable for any losses and/or damages in connection with the use of our website.

From our website, you can visit other websites by following hyperlinks to such external sites. While we strive to provide only quality links to useful and ethical websites, we have no control over the content and nature of these sites. These links to other websites do not imply a recommendation for all the content found on these sites. Site owners and content may change without notice and may occur before we have the opportunity to remove a link which may have gone 'bad'.

Please be also aware that when you leave our website, other sites may have different privacy policies and terms which are beyond our control. Please be sure to check the Privacy Policies of these sites as well as their "Terms of Service" before engaging in any business or uploading any information.

Consent

By using our website, you hereby consent to our disclaimer and agree to its terms.

Update

Should we update, amend or make any changes to this document, those changes will be prominently posted here.




#icancodebetter #sachin_dreamboy #sachindreamboy #code #coding 

Comments

Post a Comment

Popular posts from this blog

Sorting Techniques : Selection Sort , Bubble Sort , Insertion Sort

Sorting Techniques 1. Selection Sort: Idea: The inner loop selects the minimum element in the unsorted array  and places the elements in increasing order. Time complexity: O(N 2 ) #include <iostream> using namespace std; int main() {     int n;     cin>>n;   int arr[n];    for(int i=0;i<n;i++){          cin>>arr[i];   }  for(int i=0;i<n-1;i++){       for(int j=i+1;j<n;j++){            if(arr[j]<arr[i]){                 int temp =arr[j];                  arr[j]=arr[i];             arr[i]=temp;           }           }      }for(int i=0;i<n;i++){       cout<<arr[i]<<" ";    }   return 0; } 2. Bubble Sort: Idea: ...
1 comment
Read more

Time and Space complexity : What does time and space complexity mean?

 Time and Space complexity                                  Time Complexity Time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. Types of notations 1. O-notation: It is used to denote asymptotic upper bound. For a given function g(n), we denote it by O(g(n)). Pronounced as “big-oh of g of n”. It also known as worst case time complexity as it denotes the upper bound in which algorithm terminates. 2. Ω-notation: It is used to denote asymptotic lower bound. For a given function g(n), we denote it by Ω(g(n)). Pronounced as “big-omega of g of n”. It also known as best case time complexity as it denotes the lower bound in which algorithm terminates. 3. !-notation: It is used to denote the average time of a program. Comparison of functions on the basis of time complexity It follows the following order in case of time complexit...
1 comment
Read more