Visit: https://financeclub.viden.io
Knowledge in Data Structures & algorithms
structure Organisation representing power of the government
representing the power of the government by position
Syed Sadique Hussain
Advnace SQL - SQl full notes
This PDF is on topic Advnace SQL - SQl full notes . This is a part of SQL notes.
Prince S. Malav
Data Definition Language Statements - SQL Full notes
This PDF is on topic Data Definition Language Statements - SQL Full notes . This is a part of SQL notes.
Data Manipulation Language Statements - SQL full notes
This PDF is on topic Data Manipulation Language Statements - SQL full notes . This is a part of SQL notes.
Data Query Language Statements - SQL full notes
This PDF is on topic Data Query Language Statements - SQL full notes. This is a part of SQL notes.
Data Types - SQL full notes
This PDF is on topic Data Types - SQL full notes . This is a part of SQL notes.
Database Views - SQL full notes
This PDF is on topic Database Views - SQL full notes. This is a part of SQL notes.
Enhancing Database Designs - SQL full notes
This PDF is on topic Enhancing Database Designs - SQL full notes . This is a part of SQL notes.
The SQL Structure - SQL full notes
This PDF is on topic The SQL Structure - SQL full notes. This is a part of SQL notes.
Transactional Control Commands - SQL full notes
This PDF is on topic Transactional Control Commands - SQL full notes . This is a part of SQL notes.
Why study Algorithm?
As the speed of processor increases, performance is frequently said to be less central than other software quality characteristics (e.g. security, extensibility, reusability etc.). However, large problem sizes are commonplace in the area of computational science, which makes performance a very important factor. This is because longer computation time, to name a few mean slower results, less through research and higher cost of computation (if buying CPU Hours from an external party). The study of Algorithm, therefore, gives us a language to express performance as a function of problem size.
Dushyant Jodha
Linear Time Sorting
We have sorting algorithms that can sort "n" numbers in O (n log n) time.Merge Sort and Heap Sort achieve this upper bound in the worst case, and Quick Sort achieves this on Average Case.Merge Sort, Quick Sort and Heap Sort algorithm share an interesting property: the sorted order they determined is based only on comparisons between the input elements. We call such a sorting algorithm "Comparison Sort".There is some algorithm that runs faster and takes linear time such as Counting Sort, Radix Sort, and Bucket Sort but they require the special assumption about the input sequence to sort.Counting Sort and Radix Sort assumes that the input consists of an integer in a small range.Bucket Sort assumes that a random process that distributes elements uniformly over the interval generates the input.