Some_DataStructure__in__C/LinearSearch.c at main · Small-hawk/Some_DataStructure__in__C · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

#include <stdlib.h>

#define ListLimit 50    /*üñéï ìåãÝèïõò ôçò óõíäåäåìÝíçò ëßóôáò,
                            åíäåéêôéêÜ ôÝèçêå ßóï ìå 50*/

typedef int ListElementType; /*ôýðïò äåäïìÝíùí ãéá ôá óôïé÷åßá ôçò óõíäåäåìÝíçò ëßóôáò,
                                åíäåéêôéêÜ åðéëÝ÷èçêå ï ôýðïò int */

typedef ListElementType ListType[ListLimit] ;

typedef struct ListNode *ListPointer;   //ï ôýðïò ôùí äåéêôþí ãéá ôïõò êüìâïõò
typedef struct ListNode
{
	ListElementType Data;
    ListPointer Next;
} ListNode;

typedef enum {
    FALSE, TRUE
} boolean;

void LinearSearch(ListType L, int n, ListElementType Item, boolean *Found, int *Location);
void LinkedLinearSearch(ListPointer List, ListElementType Item, boolean *Found, ListPointer *LocPtr);

main()
{
}

void LinearSearch(ListType L, int n, ListElementType Item, boolean *Found, int *Location)

{
   boolean Loc;
  *Found = FALSE;
  (*Location) =1;
  while (!(*Found) && (*Location) <=n)
    if (Item==L[*Location])
      (*Found) = TRUE;
    else
      (*Location)++;
}

void LinkedLinearSearch(ListPointer List, ListElementType Item, boolean *Found, ListPointer *LocPtr)
{
  *Found=FALSE;
  *LocPtr=List;
  while (!Found && (*LocPtr)!= NULL)
    if (Item==(*LocPtr)->Data)
      (*Found)=TRUE;
    else
      (*LocPtr)=(*LocPtr)->Next;
}