Algorithms notes
44 notes by 43 users · Page 1 of 2
This Algorithms notes page on GoConqr gathers user-made notes on searching, sorting, flowcharts and time complexity. School students, university students and professional candidates can use them to study these topics, while teachers can find material to share. There are over 30 notes, spanning school and university-level material. Pick a topic to begin.
Notes
-
2.3 - Algorithms 2.3.1 - Algorithms Suitability of Different Algorithms: The goal is to design algorithms which will run quickly whil taking up the minimal amount of resources such as memory. Time Complexity: How much time an a...
-
Rearrangement Program -8 :Search an element in a sorted and rotated array Ans - An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unkno...
-
Project 1. Introduction The algorithmic way of thinking that is still called algorithmic literacy has a great impact on our life. In fact, algorithmic literacy is part of a wider concept of digital literacy. Digital literacy ...
-
sorting - created from Mind Map Merge Sort Quick Sort Bubble Sort
-
2.1 | Algorithms | 2.1.5 Sort Algorithms Sorting algorithms allow us to put data in a certain order. Efficient sorting An efficient sort algorithm is one which can sort a data set in a short time. Sort algorithms A sort algorithm is a set of ...
-
Untitled Designing an algorithm An algorithm is a plan, a logical step-by-step process for solving a problem. Algorithms are normally written as a flowchart or in pseudocode.The key to any problem-solving task is to guide your...
-
CS 2420 Sorting
-
Time complexity Complexity A linear search: very simple algorithmically, requires little extra data to run, takes a long time to work through all the values if there is a lot of data to work with, each step only eliminates a single v...
-
Algorithms - created from Mind Map Computational Thinking Pseudocode Flow Diagrams
-
Flowcharts As described earlier there are several key symbols for designing a flowchartRectangle = ProcessDiamond = DecisionParallelogram = Input / outputCurve ended rectangle = Start / stopHeaded arrows = Show direction of flow...
-
Time complexity Orders. Constant O(1) - When run time is not affected by the size of the input. e.g. the first element of an array. "A bigger class does not affect the ability to shout at Rose" Linear O(n) - Run time increases ...
-
Untitled Bubble Sort Easy sorting AlgorithmHow it works: Take any item from the unsorted part of the list Compare it to each item in the already-sorted part of the list If the item is found to be in-between the values of two e...
-
Types Of Sorting - created from Mind Map Bubble Sort Insertion Sort Merge Sort
-
Binary Search Algorithm Binary Search Binary Search starts by picking the middle element of the array. If it is larger than the item wanted, it removed the first half of the array. If it is smaller, it removes the second half. It will contin...
-
Algorithms - created from Mind Map Abstraction Decomposition Algorithmic Thinking
-
Linear Search Algorithm Linear Search The linear search steps over each element of the array comparing the value of element to the one needed. Advantages: Easy to implement Doesn't need data to be sorted Disadvantages: Very inefficient for l...
-
Untitled 1 What should be considered when designing an algorithm? If there is more than one way of solving the problem If the correct hardware is being used If the correct software is being used 2 What are the two main ways th...
-
Untitled
-
Dynamic programming Dynamic programming and greedy method both are for optimization. unlike greedy method we here discover all possible answers and then select the most optimized one time consuming we use recursive formulas here we...
-
big sorting
-
Cuaderno Informática Algorithms Analyze Design Implement Experiment It´s a step by step procedure , which defines a set of instructions to be executed in a certain order from the given input to get the desired output. ...
-
Untitled SORTING ALGORITHMS Bubble Sort Shuttle Sort
-
Untitled Algorithms using Python ALgorithm: It is a way or (list of instructions) that is used to solve a programming problem in easy and efficient way. ...
-
Access The Camera - created from Mind Map Ask driver for name Error Check if face is in window
-
AMORTIZED ALGORITHMS AND THEIR ANALYSIS AMORTIZED ALGORITHMS Algorithms are quantitative techniques to analyze the solution. It may range from analyzing an ant's path to the analysis of the effective distance travelld by the earth INTRODUCTIONS
-
Mod 4 String matching 1) Bruteforce algorithm Algorithm BruteForceMatch(T,P): Input: Strings T (text) with n characters and P (Pattern) with m characters Output: Starting index of the first substring of T matching P, or an ...
-
Intro to CS- Brilliant.org Binary Search: 1000 elements Need at most comparisons: [log(base 2) 1000]+1 compariso...
-
Binary and Linear Searching Binary and Linear Searching Binary Searching Data must be sorted and ordered. Works by eliminating random numbers and deciding if they are too large or too small. Numbers larger than numbers marked as too large or num...
-
Dijkstra NutshellSingle source algorithm Finds shortest paths to every other node on a weighted graph in O ( (|E|+|V|) * log(|V|)) Heap-del-min is called V times and its time complexity is log V. Heap-decrease-key kutsutaan jo...
-
Interval Scheduling Non-Weighted Interval Scheduling Very Simple : Greedy solution. Sort the intervals by end time and then just find the simple answer. http://www.geeksforgeeks.org/greedy-algorithms-set-1-activity-selection-proble...
-
Untitled
-
Untitled An algorithm is a term used to describe a set of instructions told to either a machine or even a computer. They are also one of the four cornerstones of computer science along side : Decomposition, Abstraction, Patter...
-
Untitled
-
Algorithms - created from Mind Map Variables and Constants Selection A process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer
-
Divide & Conquer algorithms Intro Divide & Conquer algorithms allows us to Take a problem, break it into two separate problems and try to find a solution to both of those problems. After doing so, combine the solutions to both problems in an att...
-
Untitled Role of Algorithms in computing, Order Notation, Recurrences, Probabilistic Analysis and Randomized Algorithms. Sorting and Order Statistics: Heap sort, Quick sort and Sorting in Linear Time. Advanced Design and Analy...
-
Analysis Of Algorithms
-
About Algorithms Algorithms are written in English + symbols so that we can clearly see what needs to be done without being bogged down with lines and lines of code. This mix is called Pseudo-code. Lecture one
-
reading algorithms Reading algorithms (flowchart + pseudocode) One way of representing algorithms is to use flow charts, also called flow diagrams. They are a useful way of planning how a computer program might work, and ...
-
Untitled Algorithms are a basic set of step by step instructions in the IPO format.IPO refers to Input Process and Output.Input-Process-Output-Algorithms can be illustrated via a flowchart.Variables:Variables are
More Algorithms resources
About algorithms notes
GoConqr OriginalWhat algorithms notes cover
The notes on this page cover ways to describe, search and sort data, as well as the time algorithms take. Flowcharts explains symbols for processes, decisions, input and output. Linear Search Algorithm and Binary Search Algorithm describe two approaches to finding an item in an array.
For sorting, the notes include bubble, insertion, merge and other methods. There are also notes on time complexity, divide and conquer, and dynamic programming.
How to use the notes
Start with Flowcharts if you want to review how an algorithm can be represented. If searching is your focus, read the linear search note first, then compare it with the binary search note. Write down the steps each method uses and check them against the notes.
When you want a visual overview, switch to a mind map on the Algorithms unit page. Use a quiz there to check what you remember after reading. Choose a note and start with the topic you want to review.
Frequently asked questions
Which note is a good place to start?
Flowcharts is a useful starting point if you want to review how algorithms can be represented. It describes symbols for processes, decisions, input and output. For searching, start with Linear Search Algorithm, then read Binary Search Algorithm to compare their approaches.
Are these notes free to use?
Yes. Every note listed here is free to open and study without an account. The resources were made by GoConqr users, not by GoConqr. A free account also lets you save quiz scores and make your own quizzes, mind maps, flashcards and notes.
What topics and levels do the notes cover?
The notes span school and university-level material. They include searching, sorting, flowcharts and time complexity, alongside topics such as dynamic programming. School students, university students and professional candidates can use the page to find a topic to study; teachers can find material to share.