09-03-2007
i read redbook for exam 222 two times, 2 months of theory courses and 8 months of practice.... and finally i got it....
9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Are there any nationally recognized UNIX certifications, similar to A+., for basic unix and system admin skills?
thanks (1 Reply)
Discussion started by: pacsman
1 Replies
2. What is on Your Mind?
Hi all,
I'm new to this forum also to unix, but eager to learn unix.
Can any one gimme the certifications/exams available to validate our unix strengths. (7 Replies)
Discussion started by: sarang
7 Replies
3. UNIX for Dummies Questions & Answers
Hello I am a newbie i learnt Shell programming and Unix Internals.Well plz advice me what certifications i shud do as i have free time and want to utilize my time :) (1 Reply)
Discussion started by: strawberry
1 Replies
4. Shell Programming and Scripting
Guys,
I just want information abt certifications available for unix. If they exist can anyone give some info them. Making clear I am pointing to developer level exams, not admin side.
Thanks,
Sharif.S (0 Replies)
Discussion started by: sharifhere
0 Replies
5. Shell Programming and Scripting
Hi All,
Can anybody let me know if there is any Unix certification course which will provide basically programming in Unix. (4 Replies)
Discussion started by: darshakraut
4 Replies
6. What is on Your Mind?
hi there :)
I will study the Linux LPI certification in a few months
What do u think about it?
Is this certification good enough to work with solaris too actually? I´m not sure because i think is more oriented to linux, and solaris as far as i know, is based on UNix.
What else can i... (3 Replies)
Discussion started by: andriusman
3 Replies
7. HP-UX
Hi,
I am planning to get certified on HP-UX.
I googled about HPUX Certifications. I understand that I need to pass on exam HP0-A01 but I find many references to HP0-095.
I bought this book:
HP-UX: HP Certification Systems Administrator, Exam HP0-A01 - Training Guide and Administrator's... (16 Replies)
Discussion started by: psicopunk
16 Replies
8. What is on Your Mind?
Hi ,
I am working in Perl/Shell Script for past 3 years.I am planning to learn and switch my Career as Linux Admin.So Please suggest some certifications to learn about it.Do we have separate sub categories/area of specifications in Linux Admin ? Like Virtualization ,Vmware,storage. ... (0 Replies)
Discussion started by: Ajaytts123
0 Replies
9. What is on Your Mind?
I have just been on RedHat SA 3 training course (4 days) and sat exams EX200 (RHCSA) and EX300 (RHCE)
The daft thing was that politics meant I wasn't allowed to take courses SA 1 or 2. So I learnt about stuff I would never use (SELinux; iSCSI; NFS Kerberos encrypted with user specific access... (22 Replies)
Discussion started by: rbatte1
22 Replies
BSEARCH(3) Linux Programmer's Manual BSEARCH(3)
NAME
bsearch - binary search of a sorted array
SYNOPSIS
#include <stdlib.h>
void *bsearch(const void *key, const void *base,
size_t nmemb, size_t size,
int (*compar)(const void *, const void *));
DESCRIPTION
The bsearch() function searches an array of nmemb objects, the initial member of which is pointed to by base, for a member that matches the
object pointed to by key. The size of each member of the array is specified by size.
The contents of the array should be in ascending sorted order according to the comparison function referenced by compar. The compar rou-
tine is expected to have two arguments which point to the key object and to an array member, in that order, and should return an integer
less than, equal to, or greater than zero if the key object is found, respectively, to be less than, to match, or be greater than the array
member.
RETURN VALUE
The bsearch() function returns a pointer to a matching member of the array, or NULL if no match is found. If there are multiple elements
that match the key, the element returned is unspecified.
CONFORMING TO
SVr4, 4.3BSD, POSIX.1-2001, C89, C99.
EXAMPLE
The example below first sorts an array of structures using qsort(3), then retrieves desired elements using bsearch().
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct mi {
int nr;
char *name;
} months[] = {
{ 1, "jan" }, { 2, "feb" }, { 3, "mar" }, { 4, "apr" },
{ 5, "may" }, { 6, "jun" }, { 7, "jul" }, { 8, "aug" },
{ 9, "sep" }, {10, "oct" }, {11, "nov" }, {12, "dec" }
};
#define nr_of_months (sizeof(months)/sizeof(months[0]))
static int
compmi(const void *m1, const void *m2)
{
struct mi *mi1 = (struct mi *) m1;
struct mi *mi2 = (struct mi *) m2;
return strcmp(mi1->name, mi2->name);
}
int
main(int argc, char **argv)
{
int i;
qsort(months, nr_of_months, sizeof(struct mi), compmi);
for (i = 1; i < argc; i++) {
struct mi key, *res;
key.name = argv[i];
res = bsearch(&key, months, nr_of_months,
sizeof(struct mi), compmi);
if (res == NULL)
printf("'%s': unknown month
", argv[i]);
else
printf("%s: month #%d
", res->name, res->nr);
}
exit(EXIT_SUCCESS);
}
SEE ALSO
hsearch(3), lsearch(3), qsort(3), tsearch(3)
COLOPHON
This page is part of release 3.25 of the Linux man-pages project. A description of the project, and information about reporting bugs, can
be found at http://www.kernel.org/doc/man-pages/.
2003-11-01 BSEARCH(3)