![Dealing DSA day 0/60 [coding, dsa, computer science engineering] #explorepage #boost #coding #fypppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppp #engineering](https://image.pictame.com/img/641302510_17856364611669743_1048259738966957949_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY0MTMwMjUxMF8xNzg1NjM2NDYxMTY2OTc0M18xMDQ4MjU5NzM4OTY2OTU3OTQ5X24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9U0I1ZTk4RW1EN29RN2tOdndHd1piWWwmX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZnlVR01tckpxSThabTJmT0lFNkR5a3pEMWdtYnpHUklmRFR2TXVHdEFWYmhBJm9lPTY5RDE2MEY3Jl9uY19zaWQ9YmMwYzJj)

![Pseudocode👇 for i = 0 to n-1 for j = i+1 to n-1 if arr[i] + arr[j] == target return i, j return -1 // if no pair found Example: arr = [2, 7, 11, 15] target = 9 i = 0 → arr[i] = 2 j = 1 → 2](https://image.pictame.com/img/656443353_17861594202669743_6092975059657303973_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1NjQ0MzM1M18xNzg2MTU5NDIwMjY2OTc0M182MDkyOTc1MDU5NjU3MzAzOTczX24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9ck5MdUZJcTBPVFVRN2tOdndGRTlFc28mX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZnlmWE1jSy1KUi14YVRoTEhHQ3FfMEU4S3BRNS00UWRGcVA3YVpvLUlXdWF3Jm9lPTY5RDE1Q0M2Jl9uY19zaWQ9YmMwYzJj)
![🔹 INSERTION SORT – PSEUDOCODE InsertionSort(arr, n): for i = 1 to n-1: key = arr[i] j = i - 1 while j >= 0 AND arr[j] > key: arr[j + 1] = arr[j] j = j - 1 arr[j + 1] = key 🔹 ARRAY: 5 2](https://image.pictame.com/img/655155062_17861085498669743_973389719564235197_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1NTE1NTA2Ml8xNzg2MTA4NTQ5ODY2OTc0M185NzMzODk3MTk1NjQyMzUxOTdfbi5qcGc/c3RwPWRzdC1qcGdfZTE1X3R0NiZfbmNfaHQ9aW5zdGFncmFtLmZkc2EyLTEuZm5hLmZiY2RuLm5ldCZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnRkpFMURlZUpZbzVwbHhjVUZEc0RJVHVna3BzNy1UMkRWZW9XQk8ySWRDdVdqSWV6bGhHLWZEdDBlaTRjeTRmM0kmX25jX29oYz1xVWNDSGlpb0pVb1E3a052d0ZacDhjTCZfbmNfZ2lkPUh3U1JGTl9SbVpvVkVVR2d0bFNXRWcmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmeFNTdld4VGxJWVkxZFVVdGN3eFI2R0hQS1RaenFGXzIzLW5hQVhHVFc5V1Emb2U9NjlEMTc1RjgmX25jX3NpZD1iYzBjMmM=)
![Selection Sort IMPORTANT: WE SET "min" to index(address) BECAUSE WE USE IT TO SWAP LATER. for i = 0 → n-2 min = i for j = i+1 → n-1 if arr[j] < arr[min] min = j swap(arr[i], arr[min]) Time](https://image.pictame.com/img/654892628_17860861437669743_6975196666472404300_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1NDg5MjYyOF8xNzg2MDg2MTQzNzY2OTc0M182OTc1MTk2NjY2NDcyNDA0MzAwX24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9YndyYV92S1JPZFVRN2tOdndIVXlpRncmX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZnp0emNKbWZaR1prTVhuTV9lNGpVdWhRSmk3X1NBYUViOE04ZFV0UkJSWFFnJm9lPTY5RDE2RDZBJl9uY19zaWQ9YmMwYzJj)
![By set to 0 i meant it is set to false(boolean variable) EXAMPLE ARRAY: [1, 2, 3, 5, 4] NORMAL BUBBLE SORT Pass 1: (1,2) ✔ (2,3) ✔ (3,5) ✔ (5,4) ❌ swap → [1,2,3,4,5] Pass 2: (1,2) ✔ (2,3) ✔ (3,4) ✔](https://image.pictame.com/img/656545651_17860591281669743_2582994942629415671_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1NjU0NTY1MV8xNzg2MDU5MTI4MTY2OTc0M18yNTgyOTk0OTQyNjI5NDE1NjcxX24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9aHFxcFJDc0hvYmNRN2tOdndHQW9ZZHAmX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZnlqemZ0bTl3bk90MVlNOHhTTl9BSHlJT2lBLXdfQWhESVFHQk5rWkowcUF3Jm9lPTY5RDE1QzIyJl9uY19zaWQ9YmMwYzJj)
![Bubble sort explained 👇 Consider array: [5, 4, 3, 1, 2] 5 > 4 → swap [4, 5, 3, 1, 2] 5 > 3 → swap [4, 3, 5, 1, 2]] 5 > 1 → swap [4, 3, 1, 5, 2] 5 > 2 → swap [4, 3, 1, 2, 5] Continues the sam](https://image.pictame.com/img/655192657_17860313592669743_5555943502002161468_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1NTE5MjY1N18xNzg2MDMxMzU5MjY2OTc0M181NTU1OTQzNTAyMDAyMTYxNDY4X24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9WVRDRVhIQmtDX3dRN2tOdndFeGNoSXUmX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZndCT3dOTlhyektaMWtqNzFUV2hkUWYwcG9HWGV6VXNfZ25WUTR5Z0M5Rjh3Jm9lPTY5RDE1NzVBJl9uY19zaWQ9YmMwYzJj)
![Linear Search for i = 0 → n-1 if arr[i] == key return i return -1 Time Complexity: O(n) Space Complexity: O(1) [Coding, dsa, computer science engineering] #explorepage #boost #fyp #coding #dsa](https://image.pictame.com/img/654691372_17860015629669743_4089589643470799126_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1NDY5MTM3Ml8xNzg2MDAxNTYyOTY2OTc0M180MDg5NTg5NjQzNDcwNzk5MTI2X24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9Q1RCamlUeDBhMklRN2tOdndFYXVZbVcmX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZnh0X0RyWWZSSlJvUlVidFRQSXZqY0hRaU44bi1iU0JvWUV3WnFDM3QwNG1nJm9lPTY5RDE4NDlEJl9uY19zaWQ9YmMwYzJj)
![Pseudocode: FOR i = pos TO n-2 A[i] = A[i+1] Time complexity : O(n) [Coding, dsa, computer science engineering] #explorepage #fyp #boost #coding #dsa](https://image.pictame.com/img/651025465_17858633499669743_3956118334312624946_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1MTAyNTQ2NV8xNzg1ODYzMzQ5OTY2OTc0M18zOTU2MTE4MzM0MzEyNjI0OTQ2X24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9bG9CZFRQeWtkNVFRN2tOdndHV19pVEQmX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZncwck1ZU3BTUWJ3Y08wdld2MllWU01xT01meWF2Ty12b0I5SXFPRExEeTN3Jm9lPTY5RDE2OTNBJl9uY19zaWQ9YmMwYzJj)

![Insertion in Static Array pseudocode 👇 for i from (n-1) to position arr[i+1]=arr[i] arr[position -1]=value "position-1" because indexing of array starts from 0 and position numbering starts from 1.](https://image.pictame.com/img/651657414_17858218644669743_7019869323569388018_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1MTY1NzQxNF8xNzg1ODIxODY0NDY2OTc0M183MDE5ODY5MzIzNTY5Mzg4MDE4X24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9bHpHUF9ydENwSlVRN2tOdndHaEpOeFcmX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZndsMGJYUnBGZm1ZR2hVMWhTdTdTclRKQ2JQV25MVnpMVDJqODA3U3UxZDFRJm9lPTY5RDE3QTJDJl9uY19zaWQ9YmMwYzJj)
![Array Traversal👇 pseudocode for i = 0 → n-1 access arr[i] Time Complexity → O(n) Space Complexity → O(1) Let me know if entire working code is needed. Dealing dsa day 8/60 [Coding, dsa, compute](https://image.pictame.com/img/650038504_17858010654669743_2574270678860301763_n.jpg?hash=aHR0cHM6Ly9pbnN0YWdyYW0uZmRzYTItMS5mbmEuZmJjZG4ubmV0L3YvdDUxLjgyNzg3LTE1LzY1MDAzODUwNF8xNzg1ODAxMDY1NDY2OTc0M18yNTc0MjcwNjc4ODYwMzAxNzYzX24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PWluc3RhZ3JhbS5mZHNhMi0xLmZuYS5mYmNkbi5uZXQmX25jX2NhdD0xMTEmX25jX29jPVE2Y1oyZ0ZKRTFEZWVKWW81cGx4Y1VGRHNESVR1Z2twczctVDJEVmVvV0JPMklkQ3VXakllemxoRy1mRHQwZWk0Y3k0ZjNJJl9uY19vaGM9bzZjSk9uSTE1MkVRN2tOdndINHJRNEImX25jX2dpZD1Id1NSRk5fUm1ab1ZFVUdndGxTV0VnJmVkbT1BUFU4OUZBQkFBQUEmY2NiPTctNSZvaD0wMF9BZnpFc29kbzZTUVR6T0VvVE5qbzFMTW5hLWpHZWdxMng4c1ZtZmEtVThrZHJRJm9lPTY5RDE3QkRCJl9uY19zaWQ9YmMwYzJj)
Siri👾🌻, Instagram'da bir gelişmekte olan içerik üreticisi ve Education kategorisinde yer alıyor. 292 takipçisi ve 32 gönderisi bulunan void.siri hesabının takipçi/takip oranı 10.4:1. Pictame ile tüm içerikleri anonim olarak görüntüleyin - giriş gerekmez.
void.siri'in etkileşim oranı %1.23. 1K-10K takipçili hesaplarda ortalama %5 civarında, yani büyüme potansiyeli mevcut — her topluluğun dinamiği farklı olsa da.
Son 12 gönderinin %100'i video, %0'si fotoğraf. Yaklaşık 2 günde bir yeni paylaşım — düzenli ve güvenilir bir ritim. Açıklamalar genelde orta uzunlukta, ortalama 441 karakter.
Bu profili görüntülüyorsunuz anonim olarak. Giriş yok. Aktivite takibi yok. Yalnızca herkese açık içerik.
Siri👾🌻
Son paylaşımlarda en çok ses getiren etiketleri keşfedin. Bu etiketler, profilin dijital etkisini ve içerik stratejisini şekillendiren temel ilgi alanlarını ve trend konuları yansıtır.
i try to code👩🏽💻