 अल्ए ख़्रईए आज मेरभणhaus, मेरप्बडाज मैं चाँस प配 खर लिए तो सद़गच्स्सion, �istling आप Swami,� लखचनुर ख Frühस्ण हते सत्भा की ता है ख्त्चूफाँऊु्आठा की जिभ्दि सचाँस ल को था आप आप आब गियो करner, रअँ च्पि telev cheering अपने हम वन्दी एड़े में जो और बहुत सारे प्रब्लम से अनको कैसे इंप्लिमें कर सकते हैं वो बतावा। तो पिछले वीटियो में आई फुप की आपको एड़े का बेसिक समज में आगया होगा अगर कोई भी धाूथ होग, उवाग मुजने डिच्कुष कर सकतो, तो एप मेरी इईट्फ्रमशन है, अपको खलासे जे लेनिया रैगुल लेलि तो अप मुझ से खणेक कर सकते हैं, अधरवाइस चोटे वोटे की लेए आब मुझ से बाद कर सकते हैं नहीं वो परधालक्तें पर तुरूवाई थादे वेगे दीयो अरोने जिसमे आप अप प्रक्ड्च्ताली तुल क्योई नपजब नहीं है था एकि तुल आप छ़ागी था। बच्रट तूफ कि पश्ठ़ाद के रहगा लिंगते हैं नहीं आप श़ादे जिसमỉ। बेसित वड़न यरे कैसे नप्लिमट होता है, अगर ये भीटिव आपने बिस कर दिया या पूरी भीटिव सीडिस को आप फोलो करना चाते हों. तो इस पूरी भीटिव सीडिस का जो प्लेलिस लिंक है, वो इस भीटिव के दिस्कषन मैं आबले पले पूस नम्रभर, उसके अलावा जो प्लेलिस लिंक आप को मिलेंगे वो सारे भीटिव के हैं, आब जिस में भी खमफर्टेपल आप वो फोलो कर सकते हैं. आव प्ले वीटिव का लास्ट प्रोगरन था, तो इस में ये पार्ट के लिस कर रहूं, बागती हम यूस करेंगें, और कमेंट को मोडी फाँगरन, अब देखो अगना पहला प्रुडाम है क्यून यून अड वलूज. तो हमें बेसिकिल एक आ़े में जितिमी भी वलूज में से कुझन करना यिन्वन वलूज अब यिन्वन अड वलूज नहीं, अपके आपका लग आप आप की नहीं और नहीं जो की अरे में आप यह अपने लग रहु वूट रहु तो तो तो वाग था अपको प्लस टीएग यह आप भ लग, तो तो तो ईववच लग आप यह ठूट, अपके यह ँह वट उग टीग दूद, प्राद़ी, ठूट बने उ इसले हम यहाँ प्रिंट्टेप नहीं लिख सकतें योकि हमें यह नहीं बताना कि number is even or number is odd हमें बताना है कितने even कितने odd तो उस केस में आपको लेएबल यूस कर के वो 1 से हर भार increase कर और जब यह लूँ फिनिष हो जाएगा तो आप लिखेंगे प्रिंट्टेप बैख सलच आन, even equals to percent d, then backslash n, odd equals to percent d, even comma odd. तो यह बिलक्ल सिंपल प्रिंट्टेप हैं, जिस में, double quotes में जो भी है वो as it is print होगा और जो percent d है वो even or odd variables से लिप लेएबल सोगा हैं और उसको मैंने सेप किया एक्जिक्योट कराते हैं, तो मैं 1 से 10 तक values डाल हों, आप देख सकते हैं, print होगा even 5 और odd भी 5 तो 5 यह even है, 5 यह odd है, तो प्रोपरली गाम कर रहा हैं, एक बर इसको फिट से रन कराते हैं और इस बर मैं सारे 1 इन्फुट करा रहा हैं, सारे के सारे odd numbers तो आप देख सकते हैं, even की value प्रेंट होगा 0 और odd में प्रेंट होगा 10 तो प्रोपरली गाम कर रहा हैं, कोई भी इस में problem नहीं even plus a of i and odd equals to odd plus a of i तो पहले हमने even and odd variables को 1 से न्फॉट कर रहा है था, अभी हमने even and odd variables के अंदर आरे की जो values को add कर रहा हैं, तो sum करने का यही तरीका होता है, तो loop, same time repeat over 10 times scan of, अमने value को read करने के लिखा, तो immediately आप ऋफ कुट नहांगार रहा हैं, यह खलपूद है, और same even and odd values को display करा हैं, तो आपने दिखा कितना easily प्रच्हाई वाए बहुगा, अभ यह जो भी 10 न्बर सम अम इन्पृ करेगें, उस में येवर हैं उंका अलेख से सम तरजेगा, और जतने अड हैं उंका और 2 एवन है तो सम आगया 10, 5 time 2 enter क्या तो 10, 5 time 1 enter क्या तो 5, तो स्त्रीके से प्रोगर्म प्रोपर्ली रन कर रहें, जिएक, या एकवल्स तो लवाना भुईजा तो वो आप आद कर सकते हो, भकी अप्ष्नल है, अप मैंने आप को बल अता की अगर हम एक ही लुप के अंदर � अप मुप है, लोगर सी एंपलिमिप रहा है, तो कभि कभी रिखवारि मट आते, भी हम लीटिंग सेप्रेट्गे अप टर, ख़िर Everything is separated. We will do calculation and the result will come after that. गुप अप ऎता भात उमग के लेगता को लिए भी लिए गाप चली गता। Okay, it depends. a of i is less than zero, so that will be negative, so here we will write negative plus plus and if this is also false then we will write zero plus plus so condition if this first one is true then the number is positive, if it is false then we will go to else and if we get less than zero then the number will be negative plus plus both are false then zero plus plus, so it was very simple to modify because if else you have already read in the last video so here you can print that positive equals to percent d, negative equals to percent d and zero equals to percent d then positive, negative and zero, so now let's execute it, first number is positive then zero then negative then positive, negative zero negative, positive, positive zero, so see I entered first one then after that the next positive number is two after that is nine and three means four is positive, negative is three, minus four, minus eight, minus three and zero also entered three times so the result of that is if you want to print in different lines then wherever we have written commas then you can use backslash and here if you write backslash and then you will print in different lines so in this way we have made all the numbers input from that how many positive and how many negative and how many zero numbers now we have to check how to identify maximum and minimum from the area so for that now you will have to make two variables max and min, so max I initialize it from zero and min I initialize it from three to seven six eight okay so max is zero, when you compare any number then it will be bigger than zero then it will be stored we cannot initialize the min from zero, if we initialize the min from zero then zero is already minimum so no other number will be assigned in this so we have assigned the biggest number in the min so this integer range is two byte care potting if you want you can randomly assign any other number you should first know which range you will get from your numbers so zero is assigned in max and the biggest number in the min is the cycle so that even the smallest number can be assigned in that then we have made input from the user now you will write here if k of i is greater than max then max equals to k of i okay if the number of the area you are getting input is greater than max then the number of the area will be assigned in the max and if a of i is less than min if the element of the area is smaller than min then what should be assigned in the min is a of i so this is a simple calculation which we have to implement here now after finishing this loop you can print that the maximum is equal to percent d minimum equals to percent d max comma okay so now we will execute it so i have inputted these values you can see the maximum is 10 and the minimum is 1 so in this way we have implemented this program very simply now we will talk about linear search so now there are three more programs linear search is a little tricky the sum of two 1d arrays or swapping will be very easy so we have to look at linear search carefully so now we have to implement this program so what will linear search do first it will read the area and then it will read a number and then it will say that the number is available in the area so in this case we will not do the calculation and reading so the area and then the number which we have to search and then the found or not found so we have initially zeroed the found now i am writing printf enter the number you want to search so we have scanned it and in the variable we will have to run the loop again now in this program we cannot do the calculation and reading so you should know that you can run the loop separately and do the calculation so now we will write if a of i equals to n if the area element is equal to that number so this is the area element that we will get through a of i so first it will be a0 check from n then it will be i++ then it will be a1 check then it will be a2, a3 so the value of every index of the area will be compared to n whether it matches or not if it matches it means the number is present so what we do in that case is found equals to 1 and when i told you the loop when i explained the loop in the loop video so i told you a keyword break that whenever you want to terminate the loop you can use the break suppose this n is available only in the first position so do you need to search the rest of the elements so you will not say when the number will be available in the first position then it is unnecessary to search the rest of the elements so what we are using for that is break so as soon as the condition is true the loop will break and we will get to know whether we got the number or not so for that we have set the value of the found variable initially it was 0 so now what you will do after the loop is over if found equals to 1 so if this is true then you print number is present in area and else you will write printf number is not present in area so now let's execute this so i have entered 10 numbers and i have to search for 4 so number is present in area and if 1 number is available more than 1 then this will be the first occurrence the first time it is found as soon as it is found the loop will be automatically terminated now i am searching for 50 so number is not present in area 50 is not available in the area so it works properly in both the cases now what we will do we have to find out which position is the number so what you will do is you store the i instead of found so before that let me tell you one thing if found equals to 1 then it will work because if it is 0 then it will automatically fall and if it is non-zero then it is true so you can also write this and check it now if we write i here a of i means the index position on which number is available then it will be assigned in the found and this loop will break so in that case in which you have to start the found it will be minus 1 because it can also be 0 index where number is available so if it is there then it will be problem so let's check it found not equals to minus 1 if the value of found is not minus 1 it means number is available so if it is minus 1 then it is not available now what position is available we have written at person d position and i have written found plus 1 now you are thinking why we have done plus 1 because we are storing i in the found i tells you the index number so according to the user it is not 0 so according to the user it will be at the first position so we have added 1 in every index so we will add 1 in every index number so the user oriented position will be known so now if we execute this 1 2 3 4 5 6 7 8 9 10 now as i am starting 1 now see what will it say number is present at first position so present is at 0 index but what is the print at first position because we have done found plus 1 so if you store i variable in found then you can identify in which position number is available in array so i hope you have understood this linear search program it was very easy but it is a little tricky because in this we have done many things like read array first then read number then check that number is not available and according to the value of found we have shown output so we have done many calculations then sum of 2 1d arrays into 3rd 1d array so in this program you will get to see in the same program how to manage 3 arrays sum of 2 so now we will erase them see this is 2nd 1d array and this is 3rd 1d array so now we will write enter first array values copy them now if you want to read 2 array then you will have to run different loop so that user will know which array is input loop counter variable can be same because when this loop will be finished after that it will start so loop can be different now we have to perform addition and print it here so now we will do addition and value will be printed printf 3rd array contains so this is backslash n now here I am trading a loop c of i equals to a of i b of i printf what we did c of i c of i so a i position b i will add c i and it will be printed so 2 array will add indexes and it will be stored here we have to use semicolon so 1st array contains 1 2nd array contains 2 so 3rd array is printed so this way we have 2 array indexes it'll be corresponding values c equals to a i then a i equals to b of i b of i equals to c जिके अईने उन्को प्रेंट करने के ले, अपको तो तो लूप लिए। लिए। तो यहापर तो लूप लिएंग देंगे आप