answersLogoWhite

0

There are 2 types of searcching in ds.

1>linear searching

2>binary searching

User Avatar

Wiki User

13y ago

What else can I help you with?

Related Questions

What is the difference between binary tree and tree data structure?

binary tree is a specific tree data structure where each node can have at most 2 children nodes. In a general Tree data structure nodes can have infinite children nodes.


How 2 write c code of array data structure?

An example: int array [10]; yaaa this is write but for a simple programs on array and all data structure visit codingdatastructure.blogspot.com


What are primary data structure?

A primary data structure is a data structure that is created without the use of other data structures, whereas a secondary data structure relies on a primary data structure. A data structure is an organized collection of data elements.[NOTE: Be careful not to confuse the term data structure with the term data type. It is a common mistake. This answer addresses dat structures. Often people who ask about primary data structures or primitive data structures are really asking about primitve data types.]Here is an example where an array is a primary data structure and a binary tree is a secondary data structure based on the array:An array is a primary data structure -- it is a set of sequentially numbered data elements, such as an array of integers or an array of names -- name0, name, name2, ...A binary tree is a data structure where each element (called a node) has a data component and pointers to it's left and right sub-trees. [Think of a directory of folders, but each folder can only have two sub-folders.] We can create an and store an array of nodes to set up the tree in languages like C++ or Java.The root of the tree could be node 1 in the array, it would point to nodes 2 and 3. node 2 would point to nodes 4 and 5, while node 3 would point to nodes 6 and 7 .. and so on. generally node n point to nodes 2n and 2n+1. (You can start with node 0, but the math is a little easier if you start with node 1.)The binary tree in this case is the secondary data structure, while the undelying array is the primary data structure.


Examples of hterogeneous and homogeneous data structure?

1: struct data { char *name; int age; } d; 2. int x [300];


What is difference between pointer and structures?

pointer data type that carry address:of data type that has no name but both of them must have same data type. structures you can make your own data type: struct name put any data type you wants any functions.


What type of graph would you use for comparing 2 similar kinds of data?

It depends on the kind of data you have, but a scatter plot or bar graph would be best.


How 2 recover file from recyclebin?

Try using Bitwar Data Recovery, which offers this kind of recovery.


What are the advantages of data structure?

The tree structure is useful because it easily accommodates the creation and deletion of folders and files.


What is Data level structure?

three levels of data abstraction are: 1. Physical level : how the data is stored physically and where it is stored in database. 2. Logical level : what information or data is stored in the database (like what is the datatype or what is format of data. 3.View level : end users work on view level. if any amendment is made it can be saved by other name. for the database to be usable it must retrieve data efficently.this efficency led designer to use complex data structure in the database


Is Array a linear data structure?

Conceptually, an array is a fixed size collection. However, a "ragged" array is not a linear one, nor a "matrix". Those 2 maybe thought of an array of arrays, ragged ones are arrays with different lengths, while matrices are arrays of the same length. Depends on the context of the question, an array is linear itself, regardless what kind of elements it contains. But there exists some arrays (I used math term on purposes) that are not "linear" (the ragged, the matrix, the 3-dimensional, 4-, etc.), thus, NOT all Arrays are Linear.


What are the parts of SQL language in dbms?

There are three parts of structure query language (sql) . 1.dml 2.ddl 3.dcl 1. In data manipulation language (dml) we can insert,update and delete a record. 2.in data definition language (ddl) we can change the structure of data like alter a table,create object ,drop and rename an object. 3.data control language (dcl) we can use security rights like grant ,revoke .


4 kind of structure sentences?

1. simple 2. compound 3. complex 4. compound complex