Example Operations, Algorithm with Example C Programs | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
This method is a improvement over the simple insertion sort. In this method the elements at fixed distance are compared.
Operations, Advantages, Algorithm with Example C Programs | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
In this method the elements are inserted at their appropriate place. Hence is the name insertion sort.
Operations, Algorithm with Example C Programs | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
Scan the array to find its smallest element and swap it with the first element.
Operations, Algorithm with Example C Programs | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
This is the simplest kind of sorting method in this method. We do this bubble sort procedure in several iterations, which are called passes.
Definition, Types, Applications | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
Sorting is a technique for arranging data in particular order. Order means the arrangement of data.
Types with Example C Programs | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
When we want to find out particular record efficiently from the given list of elements then there are various methods of searching that element. These methods are called searching methods.
Multiway Search Trees and Graphs | Data Structure
Subject and UNIT: Data Structure: Unit IV : Multiway Search Trees and Graphs
B-tree is a multiway search tree of order m is an ordered tree where each node has at the most m children.
Operations, Algorithm with Example C Programs | Graphs | Data Structure
Subject and UNIT: Data Structure: Unit IV : Multiway Search Trees and Graphs
A spanning tree of a graph G is a subgraph which is basically a tree and it contains all the vertices of G containing no circuit.
Operations, Algorithm with Example C Programs | Graphs | Data Structure
Subject and UNIT: Data Structure: Unit IV : Multiway Search Trees and Graphs
Dijkstra's Algorithm is a popular algorithm for finding shortest path.
Data Structure
Subject and UNIT: Data Structure: Unit IV : Multiway Search Trees and Graphs
The graph theory is used in the computer science very widely. There are many interesting applications of graph.
Euler path, Operations | Graphs | Data Structure
Subject and UNIT: Data Structure: Unit IV : Multiway Search Trees and Graphs
In graph theory there is a famous problem known as konigsberg bridge problem. In this problem the main theme was to cross the seven bridges exactly once to visit various cities.
Definition, Operations, Algorithm | Graphs | Data Structure
Subject and UNIT: Data Structure: Unit IV : Multiway Search Trees and Graphs
Definition: A vertex V is an undirected graph G is called a cut vertex iff removing it disconnects the graph.